Multicommodity flows and Benders decomposition for restricted continuous location problems.
Murat OguzTolga BektasJulia A. BennellPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- location problems
- benders decomposition
- network design problem
- single facility
- network design
- approximation algorithms
- mixed integer
- branch and bound
- minimal cost
- bicriteria
- mixed integer programming
- exact algorithms
- lagrangian relaxation
- nonlinear programming
- transportation networks
- integer programming
- evolutionary algorithm
- primal dual
- cutting plane
- valid inequalities
- lp relaxation
- continuous variables
- simulated annealing
- worst case
- np hard