Solving real-world ATSP instances by branch-and-cut

Authors:
Matteo Fischetti;Andrea Lodi;Paolo Toth
Affiliations:
DEI, University of Padova, Via Gradenigo 6/A, 35100 Padova, Italy;DEIS, University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy;DEIS, University of Bologna, Viale Risorgimento 2, 40136 Bologna, Italy
Venue:
Combinatorial optimization - Eureka, you shrink!
Year:
2003

Citing 13
Cited 1

Matrices with the Edmonds-Johnson property

Combinatorica
The asymmetric assignment problem and some new facets of the traveling salesman polytope on a directed graph

SIAM Journal on Discrete Mathematics
An efficient algorithm for the minimum capacity cut problem

Mathematical Programming: Series A and B
Facet identification for the symmetric traveling salesman polytope

Mathematical Programming: Series A and B
Facets of the asymmetric traveling salesman polytope

Mathematics of Operations Research
An additive bounding procedure for the asymmetric travelling salesman problem

Mathematical Programming: Series A and B
A lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets

Mathematical Programming: Series A and B
Algorithm 750: CDT: a subroutine for the exact solution of large-scale, asymmetric traveling salesman problems

ACM Transactions on Mathematical Software (TOMS)
A polyhedral approach to the asymmetric traveling salesman problem

Management Science
Vehicle scheduling in public transit and Lagrangean pricing

Management Science
Algorithm 595: An Enumerative Algorithm for Finding Hamiltonian Circuits in a Directed Graph

ACM Transactions on Mathematical Software (TOMS)
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints

Computational Optimization and Applications
A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems

Management Science

The effect of the asymmetry of road transportation networks on the traveling salesman problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, Fischetti, Lodi and Toth [15] surveyed exact methods for the Asymmetric Traveling Salesman Problem (ATSP) and computationally compared branch-and-bound and branch-and-cut codes. The results of this comparison proved that branch-and-cut is the most effective method to solve hard ATSP instances. In the present paper the branch-and-cut algorithms by Fischetti and Toth [17] and by Applegate, Bixby, Chvátal and Cook [2] are considered and tested on a set of 35 real-world instances including 16 new instances recently presented in [12].