• Publications
  • Influence
The Traveling Salesman Problem: A Computational Study
As the name suggests, Open Library features a library with books from the Internet Archive and lists them in the open library. Expand
  • 1,269
  • 126
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
This book presents the latest findings on one of the most intensely investigated subjects in computational mathematics--the traveling salesman problem, a problem that has inspired studies by mathematicians, chemists, and physicists. Expand
  • 494
  • 39
On the Solution of Traveling Salesman Problems
Following the theoretical studies of J.B. Robinson and H.W. Kuhn in the late 1940s and the early 1950s, G.B. Dantzig, R. Fulk- erson, and S.M. Johnson demonstrated in 1954 that large instances of theExpand
  • 323
  • 29
  • PDF
TSP Cuts Which Do Not Conform to the Template Paradigm
The first computer implementation of the Dantzig-Fulkerson-Johnson cutting-plane method for solving the traveling salesman problem, written by Martin, used subtour inequalities as well as cutting planes of Gomory's type. Expand
  • 131
  • 23
  • PDF
An Updated Mixed Integer Programming Library: MIPLIB 3.0
An Up datedMixed Integer Programming LibraryMIPLIB Rob ert E BixbyDepartment of Computational and Applied MathematicsRice UniversityHouston TX CPLEX Optimization IncSebastian CeriaSchool ofExpand
  • 254
  • 21
  • PDF
This paper reports on the fifth version of the Mixed Integer Programming Library. Expand
  • 238
  • 20
  • PDF
Solving Real-World Linear Programs: A Decade and More of Progress
This paper is an invited contribution to the 50th anniversary issue of the journalOperations Research, published by the Institute of Operations Research and Management Science (INFORMS). Expand
  • 361
  • 19
  • PDF
MIP: Theory and Practice - Closing the Gap
For many years the principal solution technique used in the practice of mixed-integer programming has remained largely unchanged: Linear programming based branch-and-bound, introduced by Land and Doig (1960). Expand
  • 276
  • 17
  • PDF
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
In this paper we discuss an implementation of Dantzig et al.'s method that is suitable for TSP instances having 1,000,000 or more cities. Expand
  • 153
  • 15
  • PDF