Approximation algorithms for the Euclidean bipartite TSP
From MaRDI portal
Publication:2488237
DOI10.1016/j.orl.2004.08.002zbMath1090.90158MaRDI QIDQ2488237
Andreas Baltz, Anand Srivastav
Publication date: 25 August 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2004.08.002
90C27: Combinatorial optimization
Related Items
On the structure and complexity of worst-case equilibria, A note on the polytope of bipartite TSP, Polynomially solvable cases of the bipartite traveling salesman problem
Cites Work