A local branching heuristic for the capacitated fixed-charge network design problem.
Inmaculada Rodríguez MartínJuan José Salazar GonzálezPublished in: Comput. Oper. Res. (2010)
Keyphrases
- capacitated fixed charge
- network design problem
- branch and bound
- approximation algorithms
- network design
- branch and bound algorithm
- lower bound
- search algorithm
- column generation
- minimal cost
- mixed integer programming
- optimal solution
- search space
- transportation networks
- valid inequalities
- lagrangian relaxation
- mixed integer
- combinatorial optimization
- upper bound
- integer programming
- tree search
- linear programming
- computer networks
- communication networks
- np hard
- dynamic programming