论文信息 - Strengthening cuts for mixed integer programs - 字舞流文

Strengthening cuts for mixed integer programs

E. Balas | R. Jeroslow

[1] R. Gomory. Some polyhedra related to combinatorial problems , 1969 .

[2] Fred W. Glover,et al. Polyhedral annexation in mixed integer and combinatorial programming , 1975, Math. Program..

[3] Egon Balas,et al. Intersection Cuts - A New Type of Cutting Planes for Integer Programming , 1971, Oper. Res..

[4] E. Balas. DISJUNCTIVE PROGRAMMING: CUTTING PLANES FROM LOGICAL CONDITIONS , 1975 .

[5] G. Owen. Cutting planes for programs with disjunctive constraints , 1973 .

[6] Egon Balas. Intersection Cuts from Disjunctive Constraints. , 1974 .