A branch-and-cut algorithm for the generalized ...
Document type :
Autre communication scientifique (congrès sans actes - poster - séminaire...): Communication dans un congrès avec actes
Title :
A branch-and-cut algorithm for the generalized traveling salesman problem with time windows
Author(s) :
Yuan, Yuan [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Cattaruzza, Diego [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Ogier, Maxime [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Semet, Frédéric [Auteur]
Integrated Optimization with Complex Structure [INOCS]
LAGIS-OSL
Integrated Optimization with Complex Structure [INOCS]
Cattaruzza, Diego [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Ogier, Maxime [Auteur]
Integrated Optimization with Complex Structure [INOCS]
Semet, Frédéric [Auteur]
Integrated Optimization with Complex Structure [INOCS]
LAGIS-OSL
Conference title :
ROADEF 2018 - 19ème Congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision
City :
Lorient
Country :
France
Start date of the conference :
2018-02-21
English keyword(s) :
generalized traveling salesman problem
time windows
branch-and-cut
time windows
branch-and-cut
HAL domain(s) :
Computer Science [cs]/Operations Research [math.OC]
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Nationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.archives-ouvertes.fr/hal-01941090/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-01941090/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-01941090/document
- Open access
- Access the document
- document
- Open access
- Access the document
- Yuan_ROADEF2018.pdf
- Open access
- Access the document