Network design arc set with variable upper bounds
Authors:
Abstract
In this paper we study the network design arc set with variable upper bounds. This set appears as a common substructure of many network design problems and is a relaxation of several fundamental mixed‐integer sets studied earlier independently. In particular, the splittable flow arc set, the unsplittable flow arc set, the single node fixed‐charge flow set, and the binary knapsack set are facial restrictions of the network design arc set with variable upper bounds. Here we describe families of strong valid inequalities that cut off all fractional extreme points of the continuous relaxation of the network design arc set with variable upper bounds. Interestingly, some of these inequalities are also new even for the aforementioned restrictions studied earlier. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(1), 17–28 2007Keywords
This publication has 24 references indexed in Scilit:
- Sequence Independent Lifting for Mixed-Integer ProgrammingOperations Research, 2004
- On the facets of the mixed?integer knapsack polyhedronMathematical Programming, 2003
- On capacitated network design cut?set polyhedraMathematical Programming, 2002
- Flow pack facets of the single node fixed-charge flow polytopeOperations Research Letters, 2001
- Lifted flow cover inequalities for mixed 0-1 integer programsMathematical Programming, 1999
- Lifted Cover Inequalities for 0-1 Integer Programs: ComplexityINFORMS Journal on Computing, 1999
- Lifted Cover Inequalities for 0-1 Integer Programs: ComputationINFORMS Journal on Computing, 1998
- Capacitated Network Design—Polyhedral Structure and ComputationINFORMS Journal on Computing, 1996
- Facets of the Knapsack Polytope From Minimal CoversSIAM Journal on Applied Mathematics, 1978
- Facets of the knapsack polytopeMathematical Programming, 1975