A MIN-MAX RELATIONSHIP FOR THE EXACT MATROID PROBLEM

被引：0
|
作者：
LECLERC, M
机构：
来源：
ARCHIV DER MATHEMATIK | 1987年 / 49卷 / 02期
关键词：
D O I：
10.1007/BF01200471
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：103 / 105
页数：3
相关论文
共 50 条
  • [31] ALTERNATIVE APPROACH TO SHAKEDOWN AS A SOLUTION OF A MIN-MAX PROBLEM
    PYCKO, S
    MROZ, Z
    [J]. ACTA MECHANICA, 1992, 93 (1-4) : 205 - 222
  • [32] The min-max edge q-coloring problem
    Larjomaa, Tommi
    Popa, Alexandru
    [J]. Journal of Graph Algorithms and Applications, 2015, 19 (01) : 505 - 528
  • [33] Min-max inequalities and the timing verification problem with max and linear constraints
    Cheng, YP
    Zheng, DZ
    [J]. DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS, 2005, 15 (02): : 119 - 143
  • [34] The Min-max Edge q-Coloring Problem
    Larjomaa, Tommi
    Popa, Alexandru
    [J]. COMBINATORIAL ALGORITHMS, IWOCA 2014, 2015, 8986 : 226 - 237
  • [35] Optimal tilt lifting of beams as a min-max problem
    F. Tin-Loi
    Z. Lee
    [J]. Structural and Multidisciplinary Optimization, 2004, 26 : 160 - 168
  • [36] THE MULTI-FACILITY MIN-MAX WEBER PROBLEM
    WATSONGANDY, CDT
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1984, 18 (01) : 44 - 50
  • [37] Heuristics for the min-max arc crossing problem in graphs
    Marti, Rafael
    Campos, Vicente
    Hoff, Arild
    Peird, Juanjo
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2018, 109 : 100 - 113
  • [38] Approximation schemes for the min-max starting time problem
    Epstein, L
    Tassa, T
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 408 - 418
  • [39] Min-Max Circuits as a Problem Solving Tool(s)
    Kovacevic, Darko
    [J]. 2013 36TH INTERNATIONAL CONVENTION ON INFORMATION AND COMMUNICATION TECHNOLOGY, ELECTRONICS AND MICROELECTRONICS (MIPRO), 2013, : 1 - 10
  • [40] On the optimal solution of the general min-max sequencing problem
    Pan, YP
    Shi, LY
    [J]. 2004 43RD IEEE CONFERENCE ON DECISION AND CONTROL (CDC), VOLS 1-5, 2004, : 3189 - 3190
12345