Multicommodity Multifacility Network Design
- 9 December 2020
- book chapter
- Published by Springer Nature
- p. 141-166
Abstract
No abstract availableKeywords
All Related Versions
This publication has 45 references indexed in Scilit:
- n-step mingling inequalities: new facets for the mixed-integer knapsack setMathematical Programming, 2010
- Mingling: mixed-integer rounding with boundsMathematical Programming, 2009
- Benders, metric and cutset inequalities for multicommodity capacitated network designComputational Optimization and Applications, 2007
- Valid inequalities based on simple mixed-integer setsMathematical Programming, 2005
- On the facets of the mixed?integer knapsack polyhedronMathematical Programming, 2003
- On capacitated network design cut?set polyhedraMathematical Programming, 2002
- Polyhedral results for the edge capacity polytopeMathematical Programming, 2002
- A branch-and-cut algorithm for capacitated network design problemsMathematical Programming, 1999
- Source sink flows with capacity installation in batchesDiscrete Applied Mathematics, 1998
- Integer knapsack and flow covers with divisible coefficients: polyhedra, optimization and separationDiscrete Applied Mathematics, 1995