Noise strategies for improving local search
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems
Journal of Automated Reasoning
Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Searching for backbones and fat: a limit-crossing approach with applications
Eighteenth national conference on Artificial intelligence
Phase transitions and backbones of the asymmetric traveling salesman problem
Journal of Artificial Intelligence Research
A backbone-search heuristic for efficient solving of hard 3-SAT formulae
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Backbones in optimization and approximation
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Clustering at the phase transition
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
Multiagent optimization system for solving the traveling salesman problem (TSP)
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Backbone of the p-median problem
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Approximate backbone based multilevel algorithm for next release problem
Proceedings of the 12th annual conference on Genetic and evolutionary computation
On Computing Backbones of Propositional Theories
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Understanding TSP difficulty by learning from evolved instances
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Review: Measuring instance difficulty for combinatorial optimization problems
Computers and Operations Research
Generating highly balanced sudoku problems as hard problems
Journal of Heuristics
Discovering the suitability of optimisation algorithms by learning from evolved instances
Annals of Mathematics and Artificial Intelligence
Is computational complexity a barrier to manipulation?
Annals of Mathematics and Artificial Intelligence
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Annals of Mathematics and Artificial Intelligence
A backbone based TSP heuristic for large instances
Journal of Heuristics
Hi-index | 0.00 |
We study the backbone of the travelling salesperson optimization problem. We prove that it is intractable to approximate the backbone with any performance guarantee, assuming that P≠NP and there is a limit on the number of edges falsely returned. Nevertheless, in practice, it appears that much of the backbone is present in close to optimal solutions. We can therefore often find much of the backbone using approximation methods based on good heuristics. We demonstrate that such backbone information can be used to guide the search for an optimal solution. However, the variance in runtimes when using a backbone guided heuristic is large. This suggests that we may need to combine such heuristics with randomization and restarts. In addition, though backbone guided heuristics are useful for finding optimal solutions, they are less help in proving optimality.