Zu verschärfungen der christofibes-schranke fü den wert einer optimalen tour des enndrelseproblems
From MaRDI portal
Publication:4742557
DOI10.1080/02331938208842797zbMath0505.90051OpenAlexW1975848186MaRDI QIDQ4742557
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/02331938208842797
contractionassignment problemscompressiontraveling salesman problemmatrix reductiondual assignment problemChristofides-bound
Related Items (4)
On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem ⋮ Sharp bounds for Karp's “patching”-algorithm for the approximate solution of the traveling salesman problem ⋮ Triangle inequality and symmetry in connection with the assignment and the traveling salesman problem ⋮ A note on dual solutions of the assignment problem in connection with the traveling salesman problem
This page was built for publication: Zu verschärfungen der christofibes-schranke fü den wert einer optimalen tour des enndrelseproblems
