The optimum assignments and a new heuristic approach for the traveling salesman problem
type: Item
instance of: scholarly article
title: The optimum assignments and a new heuristic approach for the traveling salesman problem
zbMATH Open document ID: 0514.90083
DOI: 10.1016/0020-0255(82)90055-X
author: Kabekode V. S. Bhat
published in: Information Sciences
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 3813372
zbMATH Keywords: network approach
zbMATH Keywords: error bounds
zbMATH Keywords: Karp's patching algorithm
zbMATH Keywords: nonsymmetric traveling salesman
zbMATH Keywords: assignment problem
zbMATH Keywords: augmentation procedure
zbMATH Keywords: suboptimum tours
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: n by n traveling salesman
zbMATH Keywords: comparison of algorithms
zbMATH Keywords: NP-hardness
MaRDI profile type: Publication
cites work: The Traveling Salesman Problem: A Survey
cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
cites work: A SOLVABLE CASE OF THE TRAVELING SALESMAN PROBLEM
cites work: An Algorithm for the Traveling Salesman Problem
cites work: Pathology of Traveling-Salesman Subtour-Elimination Algorithms
cites work: Q4142699
cites work: Q4155835
cites work: Some Simple Applications of the Travelling Salesman Problem
cites work: P-Complete Approximation Problems
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Discrete Optimizing
cites work: A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
cites work: On the symmetric travelling salesman problem II: Lifting theorems and facets
cites work: On the Complexity of Local Search for the Traveling Salesman Problem
cites work: Neighborhood search algorithms for guaranteeing optimal traveling salesman tours must be inefficient
cites work: A Sequential Method for Discrete Optimization Problems and its Application to the Assignment, Travelling Salesman, and Three Machine Scheduling Problems
cites work: Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
cites work: Lineare Charakterisierungen von Travelling Salesman Problemen
cites work: On the symmetric travelling salesman problem I: Inequalities
cites work: On some techniques useful for solution of transportation network problems
cites work: Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
cites work: An algorithm for then×n optimum assignment problem
cites work: Degree switching operations in networks and large scale systems assignment problems
cites work: Theory of Output Set Assignments and Degree Switching Operations
cites work: Q5515142
description: scientific article; zbMATH DE number 3813372