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)
-
Urrutia, Sebastián, (2015)
-
Dynamic programming for the minimum tour duration problem
Tilk, Christian, (2017)
- More ...
-
La industria del gas en Colombia: Estructura y competencia
García, Alfredo, (2000)
-
Competition Policy in Regulated Industries: Approaches for Emerging Economies
Aubert, Cécile,
-
La industria del gas en Colombia: Estructura y competencia
García, Alfredo, (2000)
- More ...