Travelling salesman problem tools for microcomputers

DOI10.1016/0305-0548(91)90012-GzbMath0741.90087OpenAlexW2011416092MaRDI QIDQ1184464

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

traveling salesmanheuristic algorithmssymmetric 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)

Uses Software

• TRAVEL

Cites Work

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