Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem.
Ali Ridha MahjoubLuidi SimonettiEduardo UchoaPublished in: INOC (2011)
Keyphrases
- network design problem
- heuristic solution
- network flow problem
- mixed integer
- valid inequalities
- approximation algorithms
- network design
- branch and bound
- minimal cost
- mixed integer programming
- integer programming
- transportation networks
- linear programming
- traveling salesman problem
- lot sizing
- search algorithm
- lp relaxation
- column generation
- linear program
- graphical models
- optimal solution