TRAVEL - An interactive travelling salesman problem package for the IBM-personal computer

Authors:
S. C. Boyd;W. R. Pulleyblank;G. Cornuéjols
Affiliations:
Department of Mathematics and Statistics, Carleton University, Ottawa, Ont., Canada K1S 5B6;Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ont., Canada N2L 3G1;Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA 15213, USA
Venue:
Operations Research Letters
Year:
1987

Citing 2
Cited 1

An improved solution to the traveling salesman problem with thousands of nodes

Communications of the ACM - Special section on management of information systems
An O(N log N) planar travelling salesman heuristic based on spacefilling curves

Operations Research Letters

Software section: NETPAD: An interactive graphics system for network modeling and optimization

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

This note introduces TRAVEL, a software package designed to produce probably good solutions to the Travelling Salesman Problem. The system is menu driven, allows the user to choose among various methods and features animated graphics displays of these procedures as they are running.