Optimization of a 532-city symmetric traveling salesman problem by branch and cut

Authors:
M. Padberg;G. Rinaldi
Affiliations:
Graduate School of Business Administration, New York University, Washington Square, New York, NY 10003, USA;Istituto di Analisi dei Sistemi ed Informatica del CNR, viale Manzoni 30, 00185 Rome, Italy
Venue:
Operations Research Letters
Year:
1987

Citing 1
Cited 14

The Design of the XMP Linear Programming Library

ACM Transactions on Mathematical Software (TOMS)

The optimization of printed circuit board manufacturing by improving the drilling process productivity

Computers and Industrial Engineering
An interactive simulation and analysis software for solving TSP using Ant Colony Optimization algorithms

Advances in Engineering Software
Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times

Journal of Computational and Applied Mathematics
Fast bounding procedures for large instances of the Simple Plant Location Problem

Computers and Operations Research
Survey of facial results for the traveling salesman polytope

Mathematical and Computer Modelling: An International Journal
Genetically improved presequences for euclidean traveling salesman problems

Mathematical and Computer Modelling: An International Journal
Information-theoretic approaches to branching in search

Discrete Optimization
Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation

Discrete Optimization
Large-step markov chains for the TSP incorporating local search heuristics

Operations Research Letters
The complexity of cover inequality separation11This research was supported by US Army Research Office DAAH04-94-G-0017 and NSF Grant No. DMI-9700285.

Operations Research Letters
Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies

Operations Research Letters
Large travelling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation

Operations Research Letters
A polynomial-time solution to Papadimitriou and Steiglitz's 'traps'

Operations Research Letters
Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We report the solution to optimality of a 532-city symmetric traveling salesman problem involving the optimization over 141,246 zero-one variables. The results of an earlier study by Crowder and Padberg [1] are cross-validated. In this note we briefly outline the methodology, algorithms and software system that we developed to obtain these results.