Approximation algorithms for pick-and-place robots
From MaRDI portal
Publication:1599355
DOI10.1023/A:1014923704338zbMath1015.90071OpenAlexW136673050MaRDI 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 optimizationmatchingapproximation algorithmsbipartite travelling salesman problempick-and-place robotsprinted cricuit board assembly problem
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Polynomially solvable cases of the bipartite traveling salesman problem ⋮ Approximation algorithms for the Euclidean bipartite TSP
This page was built for publication: Approximation algorithms for pick-and-place robots