J. L. Bentley. Experiments on Geometric Traveling Salesman Problem. Technical Report CS TR No. 151, AT&T Bell Laboratories, 1990. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Preference Logic Programming - Govindarajan (1995) (17 citations) (Correct)
....to specify such heuristics by comparing partial solutions and preferring one partial solution over the other. This comparison can be expressed naturally in the framework of preference logic programming. For instance, consider the nearest neighbor heuristic for the traveling salesman problem [8, 57]. The following program is the formulation of the nearest neighbor heuristic in our paradigm: tour(L,T,Cost) tour(L, T,0,Cost) tour( T,T,Cost,Cost) tour( H T] Tour,C0,C1) tour(T, H] Tour,C0,C1) tour(List, Lastcity Tour] T,C0,C) closest(Lastcity,List,City,Rest,Cost) C1 = C0 ....
J. L. Bentley. Experiments on Geometric Traveling Salesman Problem. Technical Report CS TR No. 151, AT&T Bell Laboratories, 1990.
Logic Programming with Preferences and Constraints - Jayaraman, Govindarajan, al. (Correct)
....to specify such heuristics by comparing partial solutions and preferring one partial solution over the other. This comparison can be expressed naturally in the framework of preference logic programming. For instance, consider the nearest neighbor heuristic for the traveling salesman problem [2, 24]. The following program is the formulation of the nearest neighbor heuristic in our paradigm: tsp(Tour,Cost) get vertices(V) tsp(V, Tour,0,Cost) tsp( T,T,C,C) tsp( H T] Tour,Cin,Cout) tsp(T, H] Tour,Cin,Cout) tsp(List, City Tour] T,Cin,Cout) closest(City,List,Next,Rest,Cost) ....
J. L. Bentley. Experiments on Geometric Traveling Salesman Problem. Technical Report CS TR No. 151, AT&T Bell Laboratories, 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC