An integer-programming-based approach to the close-enough traveling salesman problem
Behnam Behdani, J. Cole Smith
| 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 | Ganzzahlige Optimierung | Integer programming |
| Extent: | graph. Darst. |
|---|---|
| Type of publication: | Article |
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10010399822