A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements.
Anis KadriOumar KonéBernard GendronPublished in: Comput. Oper. Res. (2022)
Keyphrases
- worst case
- network design problem
- approximation algorithms
- lagrangian heuristic
- np hard
- branch and bound
- upper bound
- lower bound
- network flow problem
- network design
- mixed integer
- lagrangian relaxation
- integer programming
- mixed integer programming
- branch and bound algorithm
- valid inequalities
- convex optimization
- convex hull
- lot sizing
- network flow
- evolutionary algorithm
- graphical models
- denoising