A Benders Decomposition Approach for a Capacitated Multi-vehicle Covering Tour Problem with Intermediate Facilities.
Vera FischerAntoine LegrainDavid SchindlPublished in: CPAIOR (1) (2024)
Keyphrases
- benders decomposition
- network design problem
- mixed integer
- facility location
- transportation networks
- lot sizing
- network design
- approximation algorithms
- traveling salesman problem
- branch and bound
- exact algorithms
- np hard
- mixed integer programming
- convex hull
- integer programming
- minimal cost
- lagrangian relaxation
- worst case
- linear program
- valid inequalities
- bayesian networks
- minimum cost
- feasible solution