论文信息 - (1,k)-configurations and facets for packing problems - 字舞流文

(1,k)-configurations and facets for packing problems

A new class of facets for knapsack polytopes is obtained. This class of inequalities is shown to define a polytope with zero–one vertices only. A combinatorial inequality is obtained from Fulkerson's max—max inequality.

Manfred W. Padberg

[1] Uri N. Peled. Properties of Facets of Binary Polytopes , 1977 .

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

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

[4] Manfred W. Padberg. Technical Note - A Note on Zero-One Programming , 1975, Oper. Res..

[5] Peter L. Hammer,et al. Facet of regular 0–1 polytopes , 1975, Math. Program..

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

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

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