CiteSeer.IST Home
Similar documents based on text:
The Convex-Hull-and-Line Traveling Salesman Problem: A.. - Deineko, Dal, Rote (1992)
(Correct)
Similar documents based on text:
All related documents
1.2
:
The Convex-Hull-and-Line Traveling Salesman Problem: A.. - Deineko, van Dal, Rote (1992)
(Correct)
0.7
:
Well-Solvable Special Cases of the TSP: A Survey - Burkard, Deineko, van Dal.. (1995)
(Correct)
0.5
:
Long-Chord-Free and Fence-Free Tours for the Travelling.. - Deineko, Woeginger (1995)
(Correct)
0.5
:
On the Recognition of Permuted Supnick and Incomplete.. - Deineko, Rudolf.. (1994)
(Correct)
0.4
:
A General Approach To Avoiding Two by Two Submatrices - Deineko, Rudolf, Woeginger (1993)
(Correct)
0.4
:
The Travelling Salesman Problem on Permuted Monge Matrices - Burkard, Deineko, Woeginger (1995)
(Correct)
0.4
:
Sometimes Travelling is Easy: The Master Tour Problem - Deineko, Rudolf, Woeginger (1994)
(Correct)
0.4
:
Three Easy Special Cases of the Euclidean Travelling.. - Deineko, Rudolf, van.. (1995)
(Correct)
0.4
:
The N-line Traveling Salesman Problem - Rote (1991)
(Correct)
0.2
:
Radiative Transfer with Many Spectral Lines - Rainer Wehrse Institut (2002)
(Correct)
CiteSeer.IST - Copyright
Penn State
and
NEC