Travelling salesman problem tools for microcomputers

DOI10.1016/0305-0548(91)90012-GMaRDI QIDQ1184464zbMATH OpenOpenAlexFDO

Authors Kimmo Nurmi

Publication date 28 June 1992

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0305-0548(91)90012-g

zbMATH Keywords

heuristic algorithmstraveling salesmansymmetric and asymmetric distance problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer
• scientific article; zbMATH DE number 795217
• The travelling salesman problem: selected algorithms and heuristics†
• A method for solving traveling-salesman problems
• Solution of large-scale symmetric travelling salesman problems

Cites work

• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• A restricted Lagrangean approach to the traveling salesman problem
• A shortest augmenting path method for solving minimal perfect matching problems
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• Design of linear quadratic regulators with assigned eigenstructure
• Improving the Hungarian assignment algorithm
• Local Search for the Asymmetric Traveling Salesman Problem
• Matching, Euler tours and the Chinese postman
• On the symmetric travelling salesman problem: Solution of a 120-city problem
• Optimization of the movements of a component placement machine
• Some Methods of Producing Approximate Solutions to Travelling Salesman Problems with Hundreds or Thousands of Cities
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
• TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer
• The Traveling-Salesman Problem and Minimum Spanning Trees

Cited in

(16)

• Travelling salesman problem solved with simulation techniques
• The traveling salesman problem: a deterministic algorithm using tabu search
• scientific article; zbMATH DE number 4191408 (Why is no real title available?)
• An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem
• Travelling salesman problem with Matlab programming
• A method for solving traveling-salesman problems
• Certification of an optimal TSP tour through 85,900 cities
• scientific article; zbMATH DE number 4143804 (Why is no real title available?)
• Solution of a traveling salesman problem in computer component design
• Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
• scientific article; zbMATH DE number 3939119 (Why is no real title available?)
• The traveling-salesman problem
• Two truck travelling salesman simulation
• The solution of some 100-city travelling salesman problems
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• TRAVEL - An interactive travelling salesman problem package for the IBM- personal computer

Describes a project that uses

Uses Software

• TRAVEL

This page was built for publication: Travelling salesman problem tools for microcomputers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184464)