Certification of an optimal TSP tour through 85,900 cities (2009)
Robert E. Bixby, William Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun, Fschool Of Business
We describe a computer code and data that together certify the optimality of a solution to the 85,900-city traveling salesman problem pla85900, the largest instance in the TSPLIB collection of...
Abstract Certification of an optimal TSP tour through 85,900 cities (2009)
Robert E. Bixby, William Cook, Daniel G. Espinoza, Marcos Goycoolea, Keld Helsgaun, Fschool Of Business
We describe a computer code and data that together certify the optimality of a solution to the 85,900-city traveling salesman problem pla85900, the largest instance in the TSPLIB collection of...
Evaluating Approaches for Solving the Area Restriction Model in Harvest Scheduling (2008)
Marcos Goycoolea, Alan T. Murray, Andres Weintraub
We survey three integer-programming approaches for solving the area restriction model (ARM) for harvest scheduling. We describe and analyze each of these approaches in detail, comparing them both...
A Study of Domino-Parity and k-Parity Constraints for the TSP (2008)
William Cook, Daniel Espinoza, Marcos Goycoolea
Abstract. Letchford (2000) introduced the domino-parity inequalities for the symmetric traveling salesman problem and showed that if the support graph of an LP solution is planar, then the separation...
Generalized domino-parity inequalities for the TSP (2008)
William J. Cook, Daniel Espinoza, Marcos Goycoolea
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints. Just as...
William Cook, Daniel G. Espinoza, Marcos Goycoolea
doi 10.1287/ijoc.1060.0204
Cutting Planes for Large Mixed Integer Programming Models (2006)
In this thesis I focus on cutting planes for large Mixed Integer Programming (MIP) problems. More specifically, I focus on two independent cutting planes studies. The first of these deals with...
Cutting Planes for Large Mixed Integer Programming Models (2006)
In this thesis I focus on cutting planes for large Mixed Integer Programming (MIP) problems. More specifically, I focus on two independent cutting planes studies. The first of these deals with...
Implementing Domino-Parity Inequalities for the Traveling Salesman Problem (2005)
William Cook, Daniel Espinoza, Marcos Goycoolea
We describe an implementation of Letchford’s domino-parity inequalities for the (symmetric) traveling salesman problem. The implementation includes pruning methods to restrict the search for...