Approximation algorithms for pick-and-place robots

DOI10.1023/A:1014923704338MaRDI QIDQ1599355zbMATH OpenOpenAlexFDO

Authors Anand Srivastav, Hartmut Schroeter, Christoph Michel

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

zbMATH Keywords

combinatorial optimizationmatchingapproximation algorithmsbipartite travelling salesman problempick-and-place robotsprinted cricuit board assembly problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1076397
• scientific article; zbMATH DE number 3888915
• A near-tight approximation algorithm for the robot localization problem
• Approximation algorithms for the single robot line coverage problem
• Approximation algorithms for the twin robot scheduling problem
• Routing heuristics for automated pick and place machines
• Pseudo approximation algorithms with applications to optimal motion planning
• Pseudo approximation algorithms, with applications to optimal motion planning

Cited in

(2)

• Approximation algorithms for the Euclidean bipartite TSP
• Polynomially solvable cases of the bipartite traveling salesman problem

This page was built for publication: Approximation algorithms for pick-and-place robots

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599355)