Approximate Integer Decompositions for Undirected Network Design Problems.
Chandra ChekuriF. Bruce ShepherdPublished in: SIAM J. Discret. Math. (2008)
Keyphrases
- network design problem
- integer variables
- approximation algorithms
- network design
- capacitated fixed charge
- exact solution
- branch and bound
- minimal cost
- network flow problem
- branch and bound algorithm
- integer programming
- transportation networks
- lower bound
- mixed integer programming
- valid inequalities
- search algorithm
- lagrangian relaxation
- mixed integer
- optimization problems
- evolutionary algorithm
- genetic algorithm