A new extension principle algorithm for the traveling salesman problem

DOI10.1080/02331938208842784zbMath0497.90072OpenAlexW2033851048MaRDI QIDQ3962804

Guntram Scheithauer, Johannes Terno

Publication date: 1982

Published in: Mathematische Operationsforschung und Statistik. Series Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938208842784

zbMATH Keywords

algorithmbranch-and-boundasymmetric traveling salesman problemcomputational testsrandomly generated test problemscomputation of lower boundsassignment problem relaxationextension principle algorithm

Mathematics Subject Classification ID

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

Related Items (2)

On the stochastic complexity of the asymmetric traveling salesman problem ⋮ On the method of interchanging networks for permutation problems

This page was built for publication: A new extension principle algorithm for the traveling salesman problem