A network design problem with location, inventory and routing decisions.
Onur KayaDogus OzkokPublished in: GECCO (Companion) (2018)
Keyphrases
- network design problem
- routing decisions
- distribution centers
- demand points
- approximation algorithms
- network design
- mixed integer programming
- branch and bound
- supply chain
- lot sizing
- minimal cost
- mixed integer
- lagrangian relaxation
- integer programming
- facility location
- response time
- transportation networks
- service level
- valid inequalities
- lead time
- evolutionary algorithm
- multistage
- np hard