DISJUNCTIVE PROGRAMMING AND A HIERARCHY OF RELAXATIONS FOR DISCRETE OPTIMIZATION PROBLEMS

被引：284

作者：

BALAS, E

机构：

来源：

SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS | 1985年 / 6卷 / 03期

关键词：

D O I：

10.1137/0606047

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：466 / 486

页数：21

共 17 条

[1] THE PERFECTLY MATCHABLE SUBGRAPH POLYTOPE OF A BIPARTITE GRAPH [J].

BALAS, E ;

PULLEYBLANK, W .

[2]

BALAS E, 1980, MATH PROGRAM STUD, V12, P37, DOI 10.1007/BFb0120886

BALAS, E .

[4] STRENGTHENING CUTS FOR MIXED INTEGER PROGRAMS [J].

BALAS, E ;

JEROSLOW, RG .

[5]

BALAS E, 1974, MSRR348 CARN MELL U

[6]

Balas E., 1979, ANN DISCRETE MATH, V5, P3

[7]

BALAS E, 1980, MATH PROGRAMMING STU, V12, P12

[8]

Balas E., 1975, NONLINEAR PROGRAMMIN, V2, P279

[9] FACIAL DISJUNCTIVE PROGRAMS AND SEQUENCES OF CUTTING-PLANES [J].

BLAIR, CE .

[10]

Campello R. E., 1984, Mathematical Programming. Proceedings of the International Congress on Mathematical Programming, P69