Valid inequalities and facets for multi-module survivable network design problem.
Haochen LuoKiavash KianfarPublished in: Networks (2023)
Keyphrases
- network design problem
- valid inequalities
- capacitated fixed charge
- integer programming
- mixed integer programming
- facet defining inequalities
- network design
- mixed integer
- approximation algorithms
- traveling salesman problem
- linear programming
- feasible solution
- lower and upper bounds
- facet defining
- convex hull
- network flow problem
- integer program
- cutting plane
- branch and bound
- column generation
- optimal solution
- minimal cost
- transportation networks
- lagrangian relaxation
- primal dual
- production planning
- continuous variables
- computational complexity
- lot sizing
- np hard
- cost function
- special case
- search algorithm