An integer-programming-based approach to the close-enough traveling salesman problem
Year of publication: |
2014
|
---|---|
Authors: | Behdani, Behnam ; Smith, J. Cole |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 26.2014, 3, p. 415-432
|
Subject: | close-enough traveling salesman problem | geometric routing problems | mixed-integer programming | computational geometry | discretization | Tourenplanung | Vehicle routing problem | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Mathematik | Mathematics |
-
A branch-and-bound algorithm for the close-enough traveling salesman problem
Coutinho, Walton Pereira, (2016)
-
An exact approach for solving pickup-and-delivery traveling salesman problems with neighborhoods
Gao, Cai, (2023)
-
Recognising permuted Demidenko matrices
Çela, Eranda, (2023)
- More ...
-
Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks
Behdani, Behnam, (2012)
-
Behdani, Behnam, (2013)
-
On the complexity of path problems in properly colored directed graphs
Granata, Donatella, (2012)
- More ...