The survivable k-node-connected network design problem: Valid inequalities and Branch-and-Cut.
Meriem MahjoubI. DiarrassoubaAli Ridha MahjoubRaouia TaktakPublished in: Comput. Ind. Eng. (2017)
Keyphrases
- network design problem
- valid inequalities
- capacitated fixed charge
- integer programming
- mixed integer
- mixed integer programming
- linear programming
- traveling salesman problem
- cutting plane
- network design
- network flow problem
- convex hull
- column generation
- approximation algorithms
- lower and upper bounds
- feasible solution
- primal dual
- lagrangian relaxation
- cutting plane algorithm
- integer program
- linear program
- branch and bound
- minimal cost
- continuous variables
- transportation networks
- np hard
- lower bound
- search algorithm
- combinatorial optimization
- lp relaxation