The Traveling Salesman Problem: A Computational Study
- D. Applegate, R. Bixby, V. Chvátal, W. Cook
- Computer Science
- 4 February 2007
Open Library features a library with books from the Internet Archive and lists them in the open library and gives you access to over 1 million free e-Books and the ability to search using subject, title and author.
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
- D. Applegate, R. Bixby, V. Chvátal, W. Cook
- Education
- 15 January 2007
The authors are the same pioneers who for nearly two decades have led the investigation into the traveling salesman problem, and here they describe the method and computer code they used to solve a broad range of large-scale problems, and along the way they demonstrate the interplay of applied mathematics with increasingly powerful computing platforms.
On the Solution of Traveling Salesman Problems
- D. Applegate, R. Bixby, W. Cook
- History
- 1998
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 the…
A simple theorem on 3-connectivity
- R. Bixby
- Mathematics
- 1 June 1982
An Updated Mixed Integer Programming Library: MIPLIB 3.0
- R. Bixby, S. Ceria, C. Mczeal, M. Savelsbergh
- Computer Science
- 1 February 1998
An Up datedMixed Integer Programming LibraryMIPLIB Rob ert E BixbyDepartment of Computational and Applied MathematicsRice UniversityHouston TX CPLEX Optimization Inc, Sebastian Ceria, Cassandra M McZeal encourage researchers and practitioners in integer programming to submit realworld instances for consideration.
TSP Cuts Which Do Not Conform to the Template Paradigm
- D. Applegate, R. Bixby, V. Chvátal, W. Cook
- Computer ScienceComputational Combinatorial Optimization
- 15 May 2000
The purpose of this paper is to describe a technique for finding cuts that disdains all understanding of the TSP polytope and bashes on regardless of all prescribed templates.
Solving Real-World Linear Programs: A Decade and More of Progress
- R. Bixby
- EconomicsOperational Research
- 2002
One person's perspective on the development of computational tools for linear programming is described, followed by historical remarks covering the some 40 years of linear-programming developments that predate my own involvement in this subject.
A Brief History of Linear and Mixed-Integer Programming Computation
- R. Bixby
- Computer Science
- 2012
To this day the simplex algorithm remains a primary computational tool in linear and mixed-integer programming (MIP) and George Dantzig’s key contribution to LP computation is not open to debate.
MIP: Theory and Practice - Closing the Gap
- R. Bixby, M. Fenelon, Zonghao Gu, E. Rothberg, Roland Wunderling
- Computer ScienceSystem Modelling and Optimization
- 12 July 1999
The gap between theory and practice is indeed closing in the practice of mixed-integer programming, and several codes, among them LINGO1, OSL2, and XPRESS-MP3, as well as the CPLEX4 code studied in this paper, now include cutting-plane capabilities aswell as other ideas from the backlog of accumulated theory.
...
...