A novel discretization scheme for the close enough traveling salesman problem
| Year of publication: |
February
|
|---|---|
| Authors: | Carrabs, Francesco ; Cerrone, Carmine ; Cerulli, Raffaele ; Gaudioso, Manlio |
| 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. 78.2017, p. 163-171
|
| Subject: | Close-enough | Traveling salesman problem | Discretization scheme | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem |
-
Carrabs, Francesco, (2020)
-
A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
Yang, Zhao, (2018)
-
Kou, Shuhan, (2024)
- More ...
-
Carrabs, Francesco, (2020)
-
Lower and upper bounds for the spanning tree with minimum branch vertices
Carrabs, Francesco, (2013)
-
Carousel greedy : a generalized greedy algorithm with applications in optimization
Cerrone, Carmine, (2017)
- More ...