(1,K)-CONFIGURATIONS AND FACETS FOR PACKING PROBLEMS

被引：50

作者：

PADBERG, MW

机构：

来源：

关键词：

D O I：

10.1007/BF01588301

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

页码：94 / 99

页数：6

共 9 条

[1] FACETS OF KNAPSACK POLYTOPE
BALAS, E
[J]. MATHEMATICAL PROGRAMMING, 1975, 8 (02) : 146 - 164
[2] Fulkerson D., 1971, MATH PROGRAM, V1, P168
[3] FACET OF REGULAR 0-1 POLYTOPES
HAMMER, PL
JOHNSON, EL
PELED, UN
[J]. MATHEMATICAL PROGRAMMING, 1975, 8 (02) : 179 - 206
[4] Nemhauser G. L., 1974, Mathematical Programming, V6, P48, DOI 10.1007/BF01580222
[5] Padberg M. W., 1973, Mathematical Programming, V5, P199, DOI 10.1007/BF01580121
[6] ZERO-ONE PROGRAMMING
PADBERG, MW
[J]. OPERATIONS RESEARCH, 1975, 23 (04) : 833 - 837
[7] PELED UN, 1976, THESIS U WATERLOO
[8] FACES FOR A LINEAR INEQUALITY IN 0-1 VARIABLES
WOLSEY, LA
[J]. MATHEMATICAL PROGRAMMING, 1975, 8 (02) : 165 - 178
[9] ZEMEL E, 1976, THESIS CARNEGIE MELL