Approximation algorithms for pick-and-place robots
From MaRDI portal
Publication:1599355
DOI10.1023/A:1014923704338zbMath1015.90071MaRDI QIDQ1599355
Christoph Michel, Anand Srivastav, Hartmut Schroeter
Publication date: 9 June 2002
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014923704338
combinatorial optimization; matching; approximation algorithms; bipartite travelling salesman problem; pick-and-place robots; printed cricuit board assembly problem
90C59: Approximation methods and heuristics in mathematical programming
90C27: Combinatorial optimization
Related Items
Polynomially solvable cases of the bipartite traveling salesman problem, Approximation algorithms for the Euclidean bipartite TSP