| Article ID: | iaor1991288 |
| Country: | Netherlands |
| Volume: | 43 |
| Issue: | 3 |
| Start Page Number: | 313 |
| End Page Number: | 316 |
| Publication Date: | Dec 1989 |
| Journal: | European Journal of Operational Research |
| Authors: | Dost Hans-Ulrich, Terno Johannes, Scheithauer Guntram |
| Keywords: | programming: travelling salesman |
Based on the assignment problem relaxation, an approach is proposed for the stochastic complexity of the asymmetric traveling salesman problem. For an essential subproblem it results that the stochastic complexity is polynomial bounded.