The backbone of the travelling salesperson

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2005, Pages 175-180

  Kilby, Philip ^a   Slaney, John ^a,b   Walsh, Toby ^b,c  

^a AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^b CSIRO   (Australia)

^c UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION METHODS; OPTIMAL SOLUTIONS; OPTIMALITY; OPTIMIZATION PROBLEMS; PERFORMANCE GUARANTEES; RUNTIMES;

ARTIFICIAL INTELLIGENCE; OPTIMIZATION;

OPTIMAL SYSTEMS;

EID: 84880712829     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. Carla Gomes, Bart Selman, Nuno Crato, and Henry Kautz. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems. Journal of Automated Reasoning, 24(1/2):67-100, 2000.
2. S. Lin and B. Kernighan. An effective heuristic for the traveling salesman problem. Operations Research, 21:498-516, 1973.
3. Amnon Meisels and Eliezer Kaplansky. Iterative restart technique for solving timetabling problems. European Journal of Operational Research, 153(1):41-50, 2004.
4. I. Or. Travelling Salesman-Type Combinatorial Problems and Their Relation to the Logistics of Blood- Banking. PhD thesis, Dept of Industrial Eng. and Management Sciences, Northwest University, Evanston, IL., 1976.
5. Gerhard Reinelt. The Travelling Salesman. Computational Solutions for TSP Applications, Lecture Notes in Computer Science vol. 840 Springer-Verlag, 1994.
6. A.J. Beacham. The complexity of problems without backbones. Master's thesis, Dept. of Computing Science, University of Alberta, 2000.
7. P. Cheeseman, B. Kanefsky, and W.M. Taylor. Where the really hard problems are. In Proc. of 12th IJCAI, pages 331-337. 1991.
8. S. Climer and W. Zhang. Searching for backbones and fat: A limit-crossing approach with applications. In Proc. of 18th National Conf. on AI. 2002.
9. O. Dubois and G. Dequen. A backbone-search heuristic for efficient solving of hardn 3-SAT formulae. In Proc. of 17th IJCAI, pages 248-253. 2001.
10. M.R. Garey and D.S. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, 1979.
11. D. Mitchell, B. Selman, and H. Levesque. Hard and Easy Distributions of SAT Problems. In Proc. of 10th National Conf. on AI, pages 459-465. 1992.
12. R. Monasson, R. Zecchina, S. Kirkpatrick, B. Selman, and L. Troyansky. Determining computational complexity for characteristic 'phase transitions'. Nature, 400:133-137, 1998.
13. A. Parkes. Clustering at the phase transition. In Proc, of the 14th National Conf. on AI, pages 340-345. 1997.
14. Bart Selman, Henry A. Kautz, and Bram Cohen. Noise strategies for improving local search. In Proceedings of AAAI' 94), pages 337-343, 1994.
15. J. Slaney and T. Walsh. Backbones in optimization and approximation. In Proceedings of 17th IJCAI. 2001.
16. W. Zhang. Phase transitions and backbones of 3-SAT and Maximum 3-SAT. In Proc. of 7th Int. Conf. on Principles and Practice of Constraint Programming (CP2001). Springer, 2001.
17. W. Zhang. Phase transitions and backbones of the asymmetric traveling salesman problem. Journal of Artificial Intelligence Research, 21:471-497, 2004. (Pubitemid 41525908)