On the use of guided design search for discovering significant decision variables in the fixed-charge capacitated multicommodity network design problem.
Mark W. LewisPublished in: Networks (2009)
Keyphrases
- network design
- fixed charge
- network design problem
- network flow problem
- communication networks
- branch and bound
- decision variables
- minimum cost
- search algorithm
- valid inequalities
- approximation algorithms
- minimal cost
- integer programming
- network architecture
- transportation problem
- search space
- mixed integer programming
- transportation networks
- lagrangian relaxation
- network flow
- mixed integer
- production planning
- distributed databases
- sensitivity analysis
- convex hull
- probabilistic model