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 | Hotellerie | Hotel industry | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Rundreiseproblem | Travelling salesman problem | Theorie | Theory | Verkaufspersonal | Salespeople |
-
A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection
Sousa, Marques Moreira de, (2021)
-
Solving large batches of traveling salesman problems with parallel and distributed computing
Ozden, S. G., (2017)
-
Pecin, Diego, (2019)
- More ...
-
Formulations for a problem of petroleum transportation
Aizemberg, Luiz, (2014)
-
The g-connected assignment problem
Poggi de Arag~ao, Marcus, (1999)
-
Exact algorithms for the traveling salesman problem with draft limits
Battarra, Maria, (2014)
- More ...