Facets of the knapsack polytope derived from disjoint and overlapping index configurations

Authors:
Elsie Sterbin Gottlieb;M.R Rao
Affiliations:
Baruch College, The City University of New York, 17 Lexington Av., New York, NY 10010, USA;Graduate School of Business Administration, New York University, New York, USA
Venue:
Operations Research Letters
Year:
1988

Citing 0
Cited 2

Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes

Discrete Optimization
A characterization of knapsacks with the max-flow--min-cut property

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Necessary and sufficient conditions for a class of facets of the knapsack polytope which contain fractional coefficients are derived. These inequalities are based upon disjoint and overlapping minimal covers and (1, k)-configurations.