We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A POLYHEDRAL STUDY OF INTEGER VARIABLE UPPER BOUNDS.
- Authors
Klabjan, Diego; Nemhauser, George L.
- 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.
- Subjects
INTEGER programming; POLYHEDRAL functions; MATHEMATICAL inequalities; ALGORITHMS; MATHEMATICAL variables; MATHEMATICAL sequences; COMPUTATIONAL complexity; MATHEMATICS
- Publication
Mathematics of Operations Research, 2002, Vol 27, Issue 4, p711
- ISSN
0364-765X
- Publication type
Article
- DOI
10.1287/moor.27.4.711.300