ON CUTTING-PLANE PROOFS IN COMBINATORIAL OPTIMIZATION

被引:67
作者
CHVATAL, V
COOK, W
HARTMANN, M
机构
[1] UNIV BONN,INST OPERAT RES,D-5300 BONN,FED REP GER
[2] JOHNS HOPKINS UNIV,DEPT MATH SCI,BALTIMORE,MD 21218
关键词
D O I
10.1016/0024-3795(89)90476-X
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
引用
收藏
页码:455 / 499
页数:45
相关论文
共 60 条
  • [1] [Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393
  • [2] BALAS E, 1980, MATH PROGRAM STUD, V12, P19, DOI 10.1007/BFb0120885
  • [3] FACETS OF KNAPSACK POLYTOPE
    BALAS, E
    [J]. MATHEMATICAL PROGRAMMING, 1975, 8 (02) : 146 - 164
  • [4] FACETS OF KNAPSACK POLYTOPE FROM MINIMAL COVERS
    BALAS, E
    ZEMEL, E
    [J]. SIAM JOURNAL ON APPLIED MATHEMATICS, 1978, 34 (01) : 119 - 148
  • [5] Balas E., 1977, Mathematics of Operations Research, V2, P15, DOI 10.1287/moor.2.1.15
  • [6] Balas E, 1977, ANN DISCRETE MATH, V1, P13, DOI [10.1016/S0167-5060(08)70725-8, DOI 10.1016/S0167-5060(08)70725-8]
  • [7] BALAS E, 1985, MSRR522 CARN MELL U
  • [8] BALAS E, 1987, MSRR535 CARN MELL U
  • [9] ON THE CUT POLYTOPE
    BARAHONA, F
    MAHJOUB, AR
    [J]. MATHEMATICAL PROGRAMMING, 1986, 36 (02) : 157 - 173
  • [10] FACETS OF THE BIPARTITE SUBGRAPH POLYTOPE
    BARAHONA, F
    GROTSCHEL, M
    MAHJOUB, AR
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1985, 10 (02) : 340 - 358