On the stochastic complexity of the asymmetric traveling salesman problem
type: Item
instance of: scholarly article
title: On the stochastic complexity of the asymmetric traveling salesman problem
zbMATH Open document ID: 0702.90068
DOI: 10.1016/0377-2217(89)90230-0
author: Hans-Ulrich Dost
author: Johannes Terno
author: Guntram Scheithauer
published in: European Journal of Operational Research
publication date: 1989-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 4152157
zbMATH Keywords: polynomial bound
zbMATH Keywords: combinatorial analysis
zbMATH Keywords: discrete optimization
zbMATH Keywords: stochastic complexity
zbMATH Keywords: asymmetric traveling salesman
MaRDI profile type: Publication
full work available at URL: 0377-2217(89)90230-0
OpenAlex ID: W1984891736
cites work: A restricted Lagrangean approach to the traveling salesman problem
cites work: Q3686500
cites work: Pathology of Traveling-Salesman Subtour-Elimination Algorithms
cites work: Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
cites work: Q4151660
cites work: Q4198056
cites work: Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
cites work: Probabilistic analysis of solving the assignment problem for the traveling salesman problem
cites work: A new extension principle algorithm for the traveling salesman problem
cites work: Random Trees and the Analysis of Branch and Bound Procedures
cites work: Q4138484
cites work: Q3693257
cites work: Q3945940
cites work: On some techniques useful for solution of transportation network problems
description: scientific article; zbMATH DE number 4152157