THE BOOLEAN QUADRIC POLYTOPE - SOME CHARACTERISTICS, FACETS AND RELATIVES

被引：238
作者：
PADBERG, M
机构：
来源：
MATHEMATICAL PROGRAMMING | 1989年 / 45卷 / 01期
关键词：
D O I：
10.1007/BF01589101
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：139 / 172
页数：34
相关论文
共 54 条
  • [1] THE PERFECTLY MATCHABLE SUBGRAPH POLYTOPE OF A BIPARTITE GRAPH
    BALAS, E
    PULLEYBLANK, W
    [J]. NETWORKS, 1983, 13 (04) : 495 - 516
  • [2] NONLINEAR 0-1 PROGRAMMING .1. LINEARIZATION TECHNIQUES
    BALAS, E
    MAZZOLA, JB
    [J]. MATHEMATICAL PROGRAMMING, 1984, 30 (01) : 1 - 21
  • [3] SET-COVERING PROBLEM
    BALAS, E
    PADBERG, MW
    [J]. OPERATIONS RESEARCH, 1972, 20 (06) : 1152 - 1161
  • [4] SET PARTITIONING - SURVEY
    BALAS, E
    PADBERG, MW
    [J]. SIAM REVIEW, 1976, 18 (04) : 710 - 760
  • [5] BALAS E, 1967, CR HEBD ACAD SCI, V258, P5136
  • [6] BALINSKI M., 1970, P PRINC S MATH PROGR, P303
  • [7] SELECTION PROBLEM
    BALINSKI, ML
    [J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 17 (03): : 230 - 231
  • [8] ON THE CUT POLYTOPE
    BARAHONA, F
    MAHJOUB, AR
    [J]. MATHEMATICAL PROGRAMMING, 1986, 36 (02) : 157 - 173
  • [9] FACETS OF THE BIPARTITE SUBGRAPH POLYTOPE
    BARAHONA, F
    GROTSCHEL, M
    MAHJOUB, AR
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1985, 10 (02) : 340 - 358
  • [10] A SOLVABLE CASE OF QUADRATIC 0-1 PROGRAMMING
    BARAHONA, F
    [J]. DISCRETE APPLIED MATHEMATICS, 1986, 13 (01) : 23 - 26
123456