Separation of partition inequalities for the (1, 2)-survivable network design problem.
Hervé KerivinAli Ridha MahjoubPublished in: Oper. Res. Lett. (2002)
Keyphrases
- network design problem
- capacitated fixed charge
- valid inequalities
- mixed integer
- approximation algorithms
- integer variables
- network design
- mixed integer programming
- integer programming
- branch and bound
- minimal cost
- traveling salesman problem
- cutting plane
- linear programming
- lagrangian relaxation
- convex hull
- transportation networks
- primal dual
- column generation
- feasible solution
- special case
- search algorithm
- neural network
- sufficient conditions
- np hard
- markov random field
- linear program
- optimal solution