A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection
Year of publication: |
2020
|
---|---|
Authors: | Barbosa, Luiz Henrique ; Uchoa, Eduardo |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 123.2020, p. 1-48
|
Subject: | Column generation | Cut separation | Routing | Theorie | Theory | Tourenplanung | Vehicle routing problem | Hotellerie | Hotel industry | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm |
-
Pecin, Diego, (2019)
-
Enhanced Branch-Cut-and-Price algorithm for heterogeneous fleet vehicle routing problems
Pessoa, Artur, (2018)
-
A tabu search algorithm for the multi-period inspector scheduling problem
Qin, Hu, (2015)
- More ...
-
A hybrid algorithm for the Heterogeneous Fleet Vehicle Routing Problem
Subramanian, Anand, (2012)
-
Exact algorithms for the traveling salesman problem with draft limits
Battarra, Maria, (2014)
-
Formulations for a problem of petroleum transportation
Aizemberg, Luiz, (2014)
- More ...