The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut.
David HuygensMartine LabbéAli Ridha MahjoubPierre PesneauPublished in: Networks (2007)
Keyphrases
- network design problem
- valid inequalities
- capacitated fixed charge
- integer programming
- mixed integer programming
- traveling salesman problem
- linear programming
- mixed integer
- cutting plane
- network design
- feasible solution
- column generation
- network flow problem
- integer program
- lower and upper bounds
- convex hull
- transportation networks
- approximation algorithms
- lagrangian relaxation
- branch and bound
- minimal cost
- continuous variables
- np hard
- production planning
- genetic algorithm
- lot sizing
- constraint programming
- continuous relaxation
- primal dual
- lp relaxation
- linear program
- simulated annealing
- upper bound
- lower bound