ON LINEAR CHARACTERIZATIONS OF COMBINATORIAL OPTIMIZATION PROBLEMS

被引:48
作者
KARP, RM
PAPADIMITRIOU, CH
机构
[1] UNIV CALIF BERKELEY,ELECTR RES LAB,BERKELEY,CA 94720
[2] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139
[3] NATL TECH UNIV ATHENS,GR-147 ATHENS,GREECE
关键词
D O I
10.1137/0211053
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:620 / 632
页数:13
相关论文
共 24 条
[11]   THE ELLIPSOID METHOD AND ITS CONSEQUENCES IN COMBINATORIAL OPTIMIZATION [J].
GROTSCHEL, M ;
LOVASZ, L ;
SCHRIJVER, A .
COMBINATORICA, 1981, 1 (02) :169-197
[12]   SYMMETRIC TRAVELING SALESMAN PROBLEM .1. INEQUALITIES [J].
GROTSCHEL, M ;
PADBERG, MW .
MATHEMATICAL PROGRAMMING, 1979, 16 (03) :265-280
[13]  
GROTSCHEL M, 1977, POLYEDRISCHE CHARACT
[14]  
HONG S, 1976, 9TH INT S MATH PROGR
[15]  
KANNAN R, 1978, LECTURE NOTES EC MAT
[16]  
KHACHIIAN LG, 1979, DOKL AKAD NAUK SSSR+, V244, P1093
[17]  
MAURRAS JF, 1975, COMBINATORIAL PROGRA
[18]  
Nemhauser G. L., 1974, Mathematical Programming, V6, P48, DOI 10.1007/BF01580222
[19]  
Padberg M. W., 1973, Mathematical Programming, V5, P199, DOI 10.1007/BF01580121
[20]  
PADBERG MW, UNPUB MINIMUM CUT SE