New cutting-planes for the time-and/or precedence-constrained ATSP and directed VRP
Year of publication: |
2007
|
---|---|
Authors: | Mak, Vicky ; Ernst, Andreas T. |
Published in: |
Mathematical methods of operations research. - Berlin : Springer, ISSN 1432-2994, ZDB-ID 1310695-8. - Vol. 66.2007, 1, p. 69-98
|
Subject: | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Ganzzahlige Optimierung | Integer programming | Theorie | Theory |
Extent: | graph. Darst. |
---|---|
Type of publication: | Article |
Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
Language: | English |
Notes: | ATSP = Asymmetric Travelling-Salesman-Problem VRP = Vehicle-Routing-Problem |
Source: | ECONIS - Online Catalogue of the ZBW |
-
The interval min-max regret knapsack packing-delivery problem
Wang, Shijin, (2021)
-
Sampaio, Afonso H., (2017)
-
The capacitated family traveling salesperson problem
Domínguez-Casasola, Saúl, (2024)
- More ...
-
New cutting-planes for the time- and-or precedence-constrained ATSP and directed VRP
Mak, Vicky, (2007)
-
New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
Mak, Vicky, (2007)
-
New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
Mak, Vicky, (2007)
- More ...