The edge-labeled survivable network design problem: Formulations and branch-and-cut.
Mariem Ben SalemRaouia TaktakFatmah AlmathkourPublished in: RAIRO Oper. Res. (2022)
Keyphrases
- network design problem
- valid inequalities
- approximation algorithms
- benders decomposition
- network design
- integer programming
- mixed integer programming
- branch and bound
- mixed integer
- transportation networks
- lagrangian relaxation
- traveling salesman problem
- minimal cost
- linear programming
- convex hull
- cutting plane
- training data
- production planning
- column generation
- np hard
- exact solution
- continuous variables
- upper bound
- computational complexity
- bayesian networks