An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem

DOI10.1016/0895-7177(90)90371-SzbMath0691.90090OpenAlexW1996634985MaRDI QIDQ583125

Bruce R. Feiring

Publication date: 1990

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0895-7177(90)90371-s

zbMATH Keywords

traveling salesman

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
• Solution of a Large-Scale Traveling-Salesman Problem
• The Traveling-Salesman Problem
• A Method for Solving Traveling-Salesman Problems
• On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
• Branch-and-Bound Methods: A Survey
• An Algorithm for the Traveling Salesman Problem
• The Traveling Salesman Problem: A Survey
• The Traveling-Salesman Problem and Minimum Spanning Trees
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem