Geodesic
A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.
Discrete & computational geometry, Tome 2 (1987), pp. 37-48.

Voir la notice de l'article provenant de la source European Digital Mathematics Library

Mots-clés : linear incidence geometry, computational geometry, hyperplanes, linear decision tree, affine tests, n-city Traveling Salesman Problem 
@article{DCG_1987__2_131008,
     author = {M. Kolinek},
     title = {A {Polynomial-Time} {Linear} {Decision} {Tree} for the {Traveling} {Salesman} {Problem} and {Other} {NP-Complete} {Problems.}},
     journal = {Discrete & computational geometry},
     pages = {37--48},
     publisher = {mathdoc},
     volume = {2},
     year = {1987},
     zbl = {0621.90054},
     url = {http://geodesic.mathdoc.fr/item/DCG_1987__2_131008/}
}
TY  - JOUR
AU  - M. Kolinek
TI  - A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.
JO  - Discrete & computational geometry
PY  - 1987
SP  - 37
EP  - 48
VL  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DCG_1987__2_131008/
ID  - DCG_1987__2_131008
ER  - 
%0 Journal Article
%A M. Kolinek
%T A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.
%J Discrete & computational geometry
%D 1987
%P 37-48
%V 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DCG_1987__2_131008/
%F DCG_1987__2_131008
M. Kolinek. A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-Complete Problems.. Discrete & computational geometry, Tome 2 (1987), pp. 37-48. http://geodesic.mathdoc.fr/item/DCG_1987__2_131008/