A Distributed Chained Lin-Kernighan Algorithm for TSP Problems
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
How autonomy oriented computing (AOC) tackles a computationally hard optimization problem
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Planar Branch Decompositions I: The Ratcatcher
INFORMS Journal on Computing
Planar Branch Decompositions II: The Cycle Method
INFORMS Journal on Computing
Dynamic programming and fast matrix multiplication
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Tree decomposition and discrete optimization problems: A survey
Cybernetics and Systems Analysis
Catalan structures and dynamic programming in H-minor-free graphs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics
Discrete Applied Mathematics
Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm
Discrete Applied Mathematics
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
A novel local search algorithm for the traveling salesman problem that exploits backbones
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Hypertree-decomposition via branch-decomposition
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Multiagent optimization system for solving the traveling salesman problem (TSP)
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Dynamic programming and planarity: Improved tree-decomposition based algorithms
Discrete Applied Mathematics
Reducing the size of traveling salesman problem instances by fixing edges
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
How to use planarity efficiently: new tree-decomposition based algorithms
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Improving the efficiency of Helsgaun's Lin-Kernighan Heuristic for the symmetric TSP
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Finding good tours for huge Euclidean TSP instances by iterative backbone contraction
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
A local search algorithm for branchwidth
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
On complexity of the optimal recombination for the travelling salesman problem
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Computers and Industrial Engineering
Seeking global edges for traveling salesman problem in multi-start search
Journal of Global Optimization
New EAX crossover for large TSP instances
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Treewidth: characterizations, applications, and computations
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Generation of graphs with bounded branchwidth
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions
ESA'05 Proceedings of the 13th annual European conference on Algorithms
New tools and simpler algorithms for branchwidth
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Treewidth lower bounds with brambles
ESA'05 Proceedings of the 13th annual European conference on Algorithms
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
New upper bound heuristics for treewidth
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Two birds with one stone: the best of branchwidth and treewidth with one algorithm
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Improved exponential-time algorithms for treewidth and minimum fill-in
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Particle swarm for the traveling salesman problem
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
A combinatorial optimization algorithm for solving the branchwidth problem
Computational Optimization and Applications
Catalan structures and dynamic programming in H-minor-free graphs
Journal of Computer and System Sciences
Tree-width and the Sherali-Adams operator
Discrete Optimization
A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem
INFORMS Journal on Computing
The Cunningham-Geelen Method in Practice: Branch-Decompositions and Integer Programming
INFORMS Journal on Computing
A backbone based TSP heuristic for large instances
Journal of Heuristics
| Hi-index | 0.00 |
Robertson and Seymour introduced branch-width as a new connectivity invariant of graphs in their proof of the Wagner conjecture. Decompositions based on this invariant provide a natural framework for implementing dynamic-programming algorithms to solve graph optimization problems. We describe a heuristic method for finding branch decompositions; the method is based on the eigenvector technique for finding graph separators. We use this as a tool to obtain high-quality tours for the traveling salesman problem by merging collections of tours produced by standard traveling salesman heuristics.