Accelerated branch exchange heuristics for symmetric traveling salesman problems

DOI10.1002/net.3230170405zbMath0646.90082OpenAlexW2003113703MaRDI QIDQ3790961

William R. jun. Stewart

Publication date: 1987

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230170405

zbMATH Keywords

symmetric traveling salesmanbranch exchange heuristicsnumerical acceleration technique

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10)

Related Items (7)

Expected part delays as a secondary layout criterion in automated manufacturing systems ⋮ A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program ⋮ Designing and reporting on computational experiments with heuristic methods ⋮ AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS ⋮ Continuous relaxations for the traveling salesman problem ⋮ A genetic algorithm for service level based vehicle scheduling ⋮ An effective implementation of the Lin-Kernighan traveling salesman heuristic

Cites Work

• Hill Climbing with Multiple Local Optima
• Computer Solutions of the Traveling Salesman Problem
• A man-machine approach toward solving the traveling salesman problem

This page was built for publication: Accelerated branch exchange heuristics for symmetric traveling salesman problems