Optimization of a 532-city symmetric traveling salesman problem by branch and cut
type: Item
instance of: scholarly article
title: Optimization of a 532-city symmetric traveling salesman problem by branch and cut
zbMATH Open document ID: 0618.90082
DOI: 10.1016/0167-6377(87)90002-2
author: B. George
published in: Operations Research Letters
publication date: 1987-01-01T00:00:00Z
review text: 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 \textit{H. Crowder} and \textit{M. Padberg} [Manage. Sci. 26, 495-509 (1980; Zbl 0444.90068)] are cross- validated. In this note we briefly outline the methodology, algorithms and software system that we developed to obtain these results.
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4003927
zbMATH Keywords: polyhedral methods
zbMATH Keywords: software design
zbMATH Keywords: branch and cut
zbMATH Keywords: 532-city symmetric traveling salesman
Wikidata QID: Q58002963
MaRDI profile type: Publication
full work available at URL: 0167-6377(87)90002-2
OpenAlex ID: W3139666781
cites work: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
cites work: On the symmetric travelling salesman problem: Solution of a 120-city problem
cites work: Q3714900
cites work: The traveling-salesman problem and minimum spanning trees: Part II
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Q3714901
cites work: On the symmetric travelling salesman problem: A computational study
cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
description: scientific article; zbMATH DE number 4003927