Strong formulations for network design problems with connectivity requirements.
Thomas L. MagnantiS. RaghavanPublished in: Networks (2005)
Keyphrases
- network design problem
- valid inequalities
- approximation algorithms
- network design
- capacitated fixed charge
- integer programming
- network flow problem
- branch and bound
- traveling salesman problem
- minimal cost
- mixed integer
- mixed integer programming
- lower and upper bounds
- cutting plane
- neural network
- branch and bound algorithm
- convex hull
- combinatorial optimization
- linear programming
- distributed systems