学术探索
学术期刊
新闻热点
数据分析
智能评审

THE BOOLEAN QUADRIC POLYTOPE - SOME CHARACTERISTICS, FACETS AND RELATIVES

被引：237
作者：
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 [J].
BALAS, E ;
PULLEYBLANK, W .
NETWORKS, 1983, 13 (04) :495-516
[2]   NONLINEAR 0-1 PROGRAMMING .1. LINEARIZATION TECHNIQUES [J].
BALAS, E ;
MAZZOLA, JB .
MATHEMATICAL PROGRAMMING, 1984, 30 (01) :1-21
[3]   SET-COVERING PROBLEM [J].
BALAS, E ;
PADBERG, MW .
OPERATIONS RESEARCH, 1972, 20 (06) :1152-1161
[4]   SET PARTITIONING - SURVEY [J].
BALAS, E ;
PADBERG, MW .
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 [J].
BALINSKI, ML .
MANAGEMENT SCIENCE SERIES A-THEORY, 1970, 17 (03) :230-231
[8]   ON THE CUT POLYTOPE [J].
BARAHONA, F ;
MAHJOUB, AR .
MATHEMATICAL PROGRAMMING, 1986, 36 (02) :157-173
[9]   FACETS OF THE BIPARTITE SUBGRAPH POLYTOPE [J].
BARAHONA, F ;
GROTSCHEL, M ;
MAHJOUB, AR .
MATHEMATICS OF OPERATIONS RESEARCH, 1985, 10 (02) :340-358
[10]   A SOLVABLE CASE OF QUADRATIC 0-1 PROGRAMMING [J].
BARAHONA, F .
DISCRETE APPLIED MATHEMATICS, 1986, 13 (01) :23-26
123456