Global convexity in the bi-criteria Traveling Salesman problem
Text / resource
Text / resource
This work studies the solution space topology of the Traveling Salesman Problem or TSP, as a bi-objective optimization problem.
The concepts of category and range of a solution are introduced for the first time in this ...
Idioma English
Acceso abiertoRuta libre sin proxy. Acceso recomendado cuando no hay suscripción activa.
Open Access