TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer
type: Item
instance of: scholarly article
title: TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer
zbMATH Open document ID: 0615.90090
DOI: 10.1016/0167-6377(87)90029-0
published in: Operations Research Letters
publication date: 1987-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3997568
zbMATH Keywords: heuristics
zbMATH Keywords: relaxations
zbMATH Keywords: animated graphics
zbMATH Keywords: personal computer
zbMATH Keywords: TRAVEL
zbMATH Keywords: software
zbMATH Keywords: travelling salesman
author: Sylvia Boyd
author: William R. Pulleyblank
author: Gérard Cornuéjols
MaRDI profile type: Publication
full work available at URL: 0167-6377(87)90029-0
OpenAlex ID: W1985470358
Wikidata QID: Q101129207
cites work: An O(N log N) planar travelling salesman heuristic based on spacefilling curves
cites work: Optimizing over the subtour polytope of the travelling salesman problem
cites work: Q5187226
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
description: scientific article; zbMATH DE number 3997568