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

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

Bibliografske podrobnosti
izdano v:Information processing letters. 59, 6 (1996).
Glavni avtor: Deineko, Vladimir G.
Format: Article
Jezik:English
Teme:
Travelling salesman problem.
Polynomial algorithm.
Combinatorial problems.
Combinatorial optimization.