Solving survivable two-layer network design problems by metric inequalities.
Sara MattiaPublished in: Comput. Optim. Appl. (2012)
Keyphrases
- network design problem
- capacitated fixed charge
- integer variables
- network flow problem
- valid inequalities
- mixed integer
- approximation algorithms
- network design
- branch and bound
- mixed integer programming
- integer programming
- lp relaxation
- minimal cost
- integer program
- transportation networks
- multi layer
- convex hull
- traveling salesman problem
- combinatorial optimization
- feasible solution
- primal dual
- linear programming
- exact solution
- linear program
- cutting plane
- column generation
- search space
- search algorithm
- lagrangian relaxation
- lower and upper bounds
- neural network
- lot sizing
- message passing
- sufficient conditions
- objective function