Exact algorithms for the Equitable Traveling Salesman Problem
| Year of publication: |
1 September 2017
|
|---|---|
| Authors: | Kinable, Joris ; Smeulders, Bart ; Delcour, Eline ; Spieksma, Frits C. R. |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 261.2017, 2 (1.9.), p. 475-485
|
| Subject: | Combinatorial optimization | Traveling Salesman Problem | Branch-and-bound | Branch-and-price | Exact algorithms | Algorithmus | Algorithm | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Theorie | Theory |
-
Lähdeaho, Oskari, (2024)
-
A branch-and-bound algorithm for the close-enough traveling salesman problem
Coutinho, Walton Pereira, (2016)
-
Algorithms based on branch and bound for the flying sidekick traveling salesman problem
Dell'Amico, Mauro, (2021)
- More ...
-
Exact Algorithms for the Equitable Traveling Salesman Problem
Kinable, Joris, (2016)
-
A metaheuristic for the school bus routing problem with bus stop selection
Schittekat, Patrick, (2013)
-
Modelling and optimisation in European Kidney Exchange Programmes
Biró, Péter, (2021)
- More ...