A Branch&Cut algorithm for the Multi-Trip Vehicle Routing Problem with Time Windows

Diego Cattaruzza 1 Paolo Gianessi 2, 3
1 INOCS - Integrated Optimization with Complex Structure
ULB - Université Libre de Bruxelles [Bruxelles], Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Document type :
Conference papers
Complete list of metadatas

Cited literature [8 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01651581
Contributor : Paolo Gianessi <>
Submitted on : Wednesday, November 29, 2017 - 10:53:41 AM
Last modification on : Tuesday, April 9, 2019 - 1:19:40 AM

File

ROADEF2017_Cattaruzza_Gianessi...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01651581, version 1

Citation

Diego Cattaruzza, Paolo Gianessi. A Branch&Cut algorithm for the Multi-Trip Vehicle Routing Problem with Time Windows. ROADEF2017 - 18ème Conférence de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2017, Metz, France. ⟨hal-01651581⟩

Share

Metrics

Record views

623

Files downloads

602