Local optimization and the traveling salesman problem
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Analyzing the Held-Karp TSP bound: a monotonicity property with application
Information Processing Letters
Probabilistic analysis of the held and Karp lower bound for the euclidean traveling salesman problem
Mathematics of Operations Research
A parallel tabu search algorithm for large traveling salesman problems
Discrete Applied Mathematics
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Multidimensional binary search trees used for associative searching
Communications of the ACM
Finding Cuts in the TSP (A preliminary report)
Finding Cuts in the TSP (A preliminary report)
Near-optimal intraprocedural branch alignment
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Finding the right cutting planes for the TSP
Journal of Experimental Algorithmics (JEA)
Statistical mechanics methods and phase transitions in optimizationproblems
Theoretical Computer Science - Phase transitions in combinatorial problems
Channel assignment and graph labeling
Handbook of wireless networks and mobile computing
Finding the Right Cutting Planes for the TSP
ALENEX '99 Selected papers from the International Workshop on Algorithm Engineering and Experimentation
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Mathematics and Computers in Simulation
Experimental analysis of the fastest optimum cycle ratio and mean algorithms
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Cut-and-solve: an iterative search strategy for combinatorial optimization problems
Artificial Intelligence
On the Integrality Ratio for the Asymmetric Traveling Salesman Problem
Mathematics of Operations Research
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Artificial Intelligence
Method of scaling in approximate solution of the traveling salesman problem
Automation and Remote Control
A probabilistic analysis of christofides' algorithm
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |