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

Authors:
M Laurent;A Sassano
Affiliations:
CNRS-LAMSADE, Université Paris Dauphine, Place du Maréchal De Lattre De Tassigny, 75775 Paris Cédex 16, France;Istituto di Analisi dei Sistemi ed Informatica del CNR, Viale Manzoni 30, 00185 Roma, Italy
Venue:
Operations Research Letters
Year:
1992

Citing 3
Cited 1

An O(mn) algorithm for regular set-covering problems

Theoretical Computer Science
Integer and combinatorial optimization

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

Operations Research Letters

Reliability, covering and balanced matrices

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Using a result of Seymour we give a characterization of a class of knapsack problems for which the clutter of minimal covers has the max-flow-min-cut property with respect to all right-hand sides. This implies that adding the minimal cover cuts to the problem is sufficient to guarantee an integer optimum for the linear programming relaxation. We also give a characterization of all the minimal cover cuts for this class of knapsacks.