Enhanced formulations and branch-and-cut for the two level network design problem with transition facilities.
Stefan GollowitzerLuis Eduardo Neves GouveiaIvana LjubicPublished in: Eur. J. Oper. Res. (2013)
Keyphrases
- network design problem
- distribution centers
- valid inequalities
- demand points
- network design
- approximation algorithms
- benders decomposition
- mixed integer
- mixed integer programming
- branch and bound
- integer programming
- facility location
- minimal cost
- transportation networks
- lagrangian relaxation
- supply chain
- facility location problem
- feasible solution
- lower bound
- lower and upper bounds
- traveling salesman problem
- cutting plane
- primal dual
- convex hull
- linear programming
- search algorithm
- integer program
- column generation
- branch and bound algorithm
- np hard
- special case
- search space