A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
Gonzalo Lera-Romero, Juan José Miranda-Bront
| Year of publication: |
2021
|
|---|---|
| Authors: | Lera-Romero, Gonzalo ; Miranda-Bront, Juan José |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 289.2021, 3 (16.3.), p. 879-896
|
| Subject: | Traveling salesman | Profitable tour problem | Time-dependent travel times | Integer programming | Branch and cut | Tourenplanung | Vehicle routing problem | Branch-and-Bound | Branch and Bound | Ganzzahlige Optimierung | Mathematische Optimierung | Mathematical programming | Algorithmus | Algorithm | Transportzeit | Travel time | Rundreiseproblem | Travelling salesman problem |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.ejor.2019.07.014 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10012433115