论文信息 - Facets and Strong Valid Inequalities for - 字舞流文

Facets and Strong Valid Inequalities for

We give a general result showing when a valid inequality or facet of an integer polytope can be obtained from a valid inequality or facet in a subset of the variables.

[1] Manfred W. Padberg,et al. A Note on Zero-One Programming , 2016 .

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

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

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

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

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

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

[8] J. Trotter. Solution characteristics and algorithms for the vertex packing problem. , 1973 .