On the solving strategy in composite heuristics

DOI10.1016/0167-6377(92)90101-8zbMath0757.90083OpenAlexW2064449087MaRDI QIDQ1200786

Jukka Perttunen

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90101-8

zbMATH Keywords

networksEuclidean traveling salesmancomposite heuristics

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simulated Annealing – An Annotated Bibliography
• Fast Algorithms for Geometric Traveling Salesman Problems
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: On the solving strategy in composite heuristics