Combining integer linear programming with a state-of-the-art heuristic for the 2-path network design problem.
Glaubos ClímacoIsabel RossetiLuidi SimonettiMarcos GuerinePublished in: Int. Trans. Oper. Res. (2019)
Keyphrases
- integer linear programming
- network design problem
- column generation
- mixed integer programming
- branch and bound
- capacitated fixed charge
- lagrangian relaxation
- valid inequalities
- cutting plane
- integer programming
- approximation algorithms
- network design
- mixed integer
- linear programming
- branch and bound algorithm
- lower bound
- optimal solution
- combinatorial optimization
- shortest path
- global constraints
- minimal cost
- search algorithm
- linear program
- exact solution
- integer program
- transportation networks
- upper bound
- minimum cost
- constraint programming
- search space
- lot sizing
- communication networks
- dynamic programming