论文信息 - Valid Inequalities and Superadditivity for 0-1 Integer Programs

Valid Inequalities and Superadditivity for 0-1 Integer Programs

It is shown that valid inequalities for 0--1 problems can be essentially characterized by two underlying functions, one of which is superadditive. These functions are essential to the characterization of maximal inequalities, the projection of valid inequalities and the definition of a master polytope. Similar properties are shown to hold for 0--1 group problems.

Laurence A. Wolsey | L. Wolsey

[1] Manfred W. Padberg,et al. On the facial structure of set packing polyhedra , 1973, Math. Program..

[2] D. R. Fulkerson,et al. Blocking and anti-blocking pairs of polyhedra , 1971, Math. Program..

[3] Eitan Zemel. Lifting the Facets of 0-1 Polytopes. , 1974 .

[4] E. Balas,et al. Facets of the Knapsack Polytope From Minimal Covers , 1978 .

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

[6] Ellis L. Johnson. On the group problem for mixed integer programming , 1974 .

[7] Leslie E. Trotter,et al. Properties of vertex packing and independence system polyhedra , 1974, Math. Program..

[8] G. Nemhauser,et al. Integer Programming , 2020 .

[9] Laurence A. Wolsey,et al. Faces for a linear inequality in 0–1 variables , 1975, Math. Program..

[10] Laurence A. Wolsey,et al. Technical Note - Facets and Strong Valid Inequalities for Integer Programs , 1976, Oper. Res..

[11] Ellis L. Johnson,et al. Some continuous functions related to corner polyhedra , 1972, Math. Program..

[12] Peter L. Hammer,et al. The Role of Master Polytopes in the Unit Cube , 1977 .

[13] Egon Balas,et al. Facets of the knapsack polytope , 1975, Math. Program..

[14] Laurence A. Wolsey. Valid inequalities, covering problems and discrete dynamic programs , 1977 .