The Convex-hull and k-line travelling salesman problem.

The Convex-hull and k-line travelling salesman problem.

Dades bibliogràfiques
Publicat a:Information processing letters. 59, 6 (1996).
Autor principal: Deineko, Vladimir G.
Format: Article
Idioma:English
Matèries:
Travelling salesman problem.
Polynomial algorithm.
Combinatorial problems.
Combinatorial optimization.