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

来源：

SIAM JOURNAL ON COMPUTING | 1982年 / 11卷 / 04期

关键词：

D O I：

10.1137/0211053

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：620 / 632

页数：13

共 24 条

[1]

[Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393

[2]

ASPVALL B, 1979, STANCS776 STANF U CO

[3] FACETS OF KNAPSACK POLYTOPE [J].

BALAS, E .

MATHEMATICAL PROGRAMMING, 1975, 8 (02) :146-164

[4] BOUNDS ON POSITIVE INTEGRAL SOLUTIONS OF LINEAR DIOPHANTINE EQUATIONS [J].

BOROSH, I ;

TREYBIG, LB .

PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1976, 55 (02) :299-304

[5]

Chvatal V., 1973, Mathematical Programming, V5, P29, DOI 10.1007/BF01580109

[6]

COOK SA, 1976, UNPUB SHORT PROOF LI

[7] PATHS TREES AND FLOWERS [J].

EDMONDS, J .

CANADIAN JOURNAL OF MATHEMATICS, 1965, 17 (03) :449-&

[8] MAXIMUM MATCHING AND A POLYHEDRON WITH O'1-VERTICES [J].

EDMONDS, J .

JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICS AND MATHEMATICAL, 1965, B 69 (1-2) :125-+

[9]

GATHEN J, 1978, LINEAR INTEGER INEQU

[10] SYMMETRIC TRAVELING SALESMAN PROBLEM .2. LIFTING THEOREMS AND FACETS [J].

GROTSCHEL, M ;

PADBERG, MW .

MATHEMATICAL PROGRAMMING, 1979, 16 (03) :281-302

← 1 2 3 →