On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows.
Julien BramelDavid Simchi-LeviPublished in: Oper. Res. (1997)
Keyphrases
- set covering
- vehicle routing problem with time windows
- column generation
- integer programming
- waste collection
- valid inequalities
- set covering problem
- vehicle routing problem
- multi depot
- routing problem
- hypergraph model
- integer program
- exact algorithms
- combinatorial auctions
- np hard
- branch and bound
- linear programming
- upper bound