Integer programming models and branch-and-cut approaches to generalized {0, 1, 2}-survivable network design problems.
Markus LeitnerPublished in: Comput. Optim. Appl. (2016)
Keyphrases
- network design problem
- integer programming
- valid inequalities
- lagrangian relaxation
- approximation algorithms
- np hard
- network design
- linear programming
- constraint programming
- transportation networks
- branch and bound
- column generation
- mixed integer
- production planning
- integer program
- probabilistic model
- minimal cost
- objective function
- neural network model
- constraint satisfaction
- network flow