An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem
type: Item
instance of: scholarly article
title: An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem
zbMATH Open document ID: 0691.90090
DOI: 10.1016/0895-7177(90)90371-S
published in: Mathematical and Computer Modelling
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 4131981
zbMATH Keywords: traveling salesman
author: Bruce R. Feiring
MaRDI profile type: Publication
cites work: Solution of a Large-Scale Traveling-Salesman Problem
cites work: The Traveling-Salesman Problem
cites work: Q3903001
cites work: Q3328583
cites work: On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
cites work: The Traveling Salesman Problem: A Survey
cites work: A Method for Solving Traveling-Salesman Problems
cites work: Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
cites work: An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Branch-and-Bound Methods: A Survey
cites work: An Algorithm for the Traveling Salesman Problem
cites work: The Traveling-Salesman Problem and Minimum Spanning Trees
full work available at URL: 0895-7177(90)90371-s
OpenAlex ID: W1996634985
description: scientific article; zbMATH DE number 4131981