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

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

Xehetasun bibliografikoak
Argitaratua izan da:Information processing letters. 59, 6 (1996).
Egile nagusia: Deineko, Vladimir G.
Formatua: Artikulua
Hizkuntza:English
Gaiak:
Travelling salesman problem.
Polynomial algorithm.
Combinatorial problems.
Combinatorial optimization.