A branch-and-cut algorithm for the generalized traveling salesman problem with time windows

Yuan Yuan 1 Diego Cattaruzza 1 Maxime Ogier 1 Frédéric Semet 2, 1
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
2 LAGIS-OSL
LAGIS - Laboratoire d'Automatique, Génie Informatique et Signal
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01941090
Contributor : Yuan Yuan <>
Submitted on : Friday, November 30, 2018 - 4:49:01 PM
Last modification on : Friday, March 22, 2019 - 1:37:08 AM
Long-term archiving on : Friday, March 1, 2019 - 3:50:45 PM

File

Yuan_ROADEF2018.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01941090, version 1

Citation

Yuan Yuan, Diego Cattaruzza, Maxime Ogier, Frédéric Semet. A branch-and-cut algorithm for the generalized traveling salesman problem with time windows. ROADEF 2018 - 19ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Feb 2018, Lorient, France. ⟨hal-01941090⟩

Share

Metrics

Record views

70

Files downloads

68