Abstract.
We study the facial structure of a polyhedron associated with the single node relaxation of network flow problems with additive variable upper bounds. This type of structure arises, for example, in production planning problems with setup times and in network certain expansion problems. We derive several classes of valid inequalities for this polyhedron and give conditions under which they are facet–defining. Our computational experience with large network expansion problems indicates that these inequalities are very effective in improving the quality of the linear programming relaxations.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: April 15, 1999 / Accepted: October 10, 2000¶Published online May 18, 2001
Rights and permissions
About this article
Cite this article
Atamtürk, A., Nemhauser, G. & Savelsbergh, M. Valid inequalities for problems with additive variable upper bounds. Math. Program. 91, 145–162 (2001). https://doi.org/10.1007/s101070100235
Issue Date:
DOI: https://doi.org/10.1007/s101070100235