Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
David Applegate, Robert E. Bixby, Vašek Chvátal et al. · Mathematical Programming · 2003
Cited by 166 works. doi:10.1007/s10107-003-0440-4
Authors
References
- Introduction to Algorithms
- A Method for the Construction of Minimum-Redundancy Codes
- Flows in networks
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Integer programming
- Maximum matching and a polyhedron with 0,1-vertices
- Integer and Combinatorial Optimization
- Theory of Linear and Integer Programming
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Efficiency of a Good But Not Linear Set Union Algorithm