Multicommodity Capacitated Network Design
- 1 January 1999
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Network Design Using Cut InequalitiesSIAM Journal on Optimization, 1996
- Integer multicommodity flow problemsPublished by Springer Nature ,1996
- A Decomposition Algorithm for Local Access Telecommunications Network Expansion PlanningOperations Research, 1995
- A column generation and partitioning approach for multi-commodity flow problemsTelecommunication Systems, 1994
- Modeling and Heuristic Worst-Case Performance Analysis of the Two-Level Network Design ProblemManagement Science, 1994
- A Dual-Based Algorithm for Multi-Level Network DesignManagement Science, 1994
- A lift-and-project cutting plane algorithm for mixed 0–1 programsMathematical Programming, 1993
- A Dual-Ascent Procedure for Large-Scale Uncapacitated Network DesignOperations Research, 1989
- A composite algorithm for a concave‐cost network flow problemNetworks, 1989
- LP extreme points and cuts for the fixed-charge network design problemMathematical Programming, 1987