A polyhedral study of integer variable upper bounds

A polyhedral study of integer variable upper bounds

0.00 Avg rating0 Votes
Article ID: iaor2004740
Country: United States
Volume: 27
Issue: 4
Start Page Number: 711
End Page Number: 739
Publication Date: Nov 2002
Journal: Mathematics of Operations Research
Authors: ,
Keywords: networks
Abstract:

We study the polyhedron of the single node capacitated network design model with integer variable upper bounds. We first give a characterization of valid inequalities that is useful in proving the validity of several classes of inequalities. Next we derive several classes of valid inequalities and we give conditions for them to be facet-defining. Sequence independent lifting is used to obtain additional facets. We conclude by reporting computational results with a branch-and-cut algorithm.

Reviews

Required fields are marked *. Your email address will not be published.