A new approach to the minimum cut problem
Journal of the ACM (JACM)
Near-optimal intraprocedural branch alignment
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Asymptotic experimental analysis for the Held-Karp traveling salesman bound
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Improved Large-Step Markov Chain Variants for the Symmetric TSP
Journal of Heuristics
On the Separation of Maximally Violated mod-k Cuts
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Polynomial-Time Separation of Simple Comb Inequalities
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A New Approach to Cactus Construction Applied to TSP Support Graphs
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
TSP Cuts Which Do Not Conform to the Template Paradigm
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Branch, Cut, and Price: Sequential and Parallel
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
An Application of Branch and Cut to Open Pit Mine Scheduling
Journal of Global Optimization
Embedded local search approaches for routing optimization
Computers and Operations Research
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
Optimal sequencing of tasks in an aluminium smelter casthouse
Computers in Industry - Special issue: Application of genetics algorithms in industry
Maximally Violated Mod-p Cuts for the Capacitated Vehicle-Routing Problem
INFORMS Journal on Computing
An Iterated Local Search Approach for Finding Provably Good Solutions for Very Large TSP Instances
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Information-theoretic approaches to branching in search
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results
Computational Biology and Chemistry
Optimal sequencing of tasks in an aluminium smelter casthouse
Computers in Industry - Special issue: Application of genetics algorithms in industry
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
Improving linear programming approaches for the steiner tree problem
WEA'03 Proceedings of the 2nd international conference on Experimental and efficient algorithms
A Branch-and-Cut method for the Capacitated Location-Routing Problem
Computers and Operations Research
Framework for distributed evolutionary algorithms in computational grids
ISICA'10 Proceedings of the 5th international conference on Advances in computation and intelligence
A parallel branch-and-cut approach for detailed placement
ACM Transactions on Design Automation of Electronic Systems (TODAES)
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Information-theoretic approaches to branching in search
Discrete Optimization
Operations Research Letters
Hi-index | 0.00 |
TSPLIB is Gerhard Reinelt''s library of some hundred instances of the traveling salesman problem. Some of these instances arise from drilling holes in printed circuit boards; others arise from X-ray crystallography; yet others have been constructed artificially. None of them (with a single exception) is contrived to be hard and none of them is contrived to be easy; their sizes range from 17 to 85,900 cities; some of them have been solved and others have not. We have solved twenty previously unsolved problems from the TSPLIB. One of them is the problem with 225 cities that was contrived to be hard; the sizes of the remaining nineteen range from 1,000 to 7,397 cities. Like all the successful computer programs for solving the TSP, our computer program follows the scheme designed by George Dantzig, Ray Fulkerson, and Selmer Johnson in the early nineteen-fifties. The purpose of this preliminary report is to describe *some* of our innovations in implementing the Dantzig-Fulkerson-Johnson scheme; we are planning to write up a more comprehensive account of our work soon.