The two-convex-polygons TSP: A solvable case
Year of publication: |
1997
|
---|---|
Authors: | García, Alfredo ; Tejel, F. |
Published in: |
TOP: An Official Journal of the Spanish Society of Statistics and Operations Research. - Springer. - Vol. 5.1997, 1, p. 105-126
|
Publisher: |
Springer |
Subject: | Travelling salesman problem | convex polygon | dynamic programming |
-
Model of megalopolises in the tool path optimisation for CNC plate cutting machines
Čencov, Aleksandr Georgievič, (2018)
-
Exact methods for the traveling salesman problem with drone
Roberti, Roberto, (2021)
-
Dynamic programming for the time-dependent traveling salesman problem with time windows
Lera-Romero, Gonzalo, (2022)
- More ...
-
Zeng, Siliang, (2025)
-
Dynamic price competition with switching costs
Fabra, Natalia, (2012)
-
Modeling electricity markets : a brief introduction
García, Alfredo, (2010)
- More ...