A branch-and-bound algorithm for the close-enough traveling salesman problem
Walton Pereira Coutinho, Roberto Quirino do Nascimento, Artur Alves Pessoa, Anand Subramanian
| Year of publication: |
2016
|
|---|---|
| Authors: | Coutinho, Walton Pereira ; Nascimento, Roberto Quirino do ; Pessoa, Artur ; Subramanian, Anand |
| Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 28.2016, 4, p. 752-765
|
| Subject: | close-enough traveling salesman problem | branch-and-bound | second-order cone programming | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Theorie | Theory | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1287/ijoc.2016.0711 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://ebvufind01.dmz1.zbw.eu/10011617601