Integrally indecomposable polytopes and the survivable network design problem.
Elke EisenschmidtMatthias KöppePublished in: DRCN (2007)
Keyphrases
- network design problem
- valid inequalities
- integer programming
- convex hull
- mixed integer
- network design
- benders decomposition
- mixed integer programming
- approximation algorithms
- linear programming
- traveling salesman problem
- branch and bound
- cutting plane
- feasible solution
- lower and upper bounds
- lagrangian relaxation
- column generation
- np hard
- minimal cost
- transportation networks
- primal dual
- linear program
- integer program
- network flow
- neural network
- network architecture
- special case
- bayesian networks