Approximation algorithms for pick-and-place robots
type: Item
instance of: scholarly article
title: Approximation algorithms for pick-and-place robots
zbMATH Open document ID: 1015.90071
DOI: 10.1023/A:1014923704338
author: Anand Srivastav
author: Hartmut Schroeter
author: Christoph Michel
published in: Annals of Operations Research
publication date: 2002-06-09T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1752544
zbMATH Keywords: pick-and-place robots
zbMATH Keywords: printed cricuit board assembly problem
zbMATH Keywords: approximation algorithms
zbMATH Keywords: bipartite travelling salesman problem
zbMATH Keywords: matching
zbMATH Keywords: combinatorial optimization
MaRDI profile type: Publication
full work available at URL: a:1014923704338
OpenAlex ID: W136673050
Recommended article: Q4359755
Recommended article: Q3221406
Recommended article: A Near-Tight Approximation Algorithm for the Robot Localization Problem
Recommended article: Approximation Algorithms for the Single Robot Line Coverage Problem
Recommended article: Approximation algorithms for the twin robot scheduling problem
Recommended article: Routing heuristics for automated pick and place machines
Recommended article: Pseudo approximation algorithms with applications to optimal motion planning
Recommended article: Pseudo approximation algorithms, with applications to optimal motion planning
description: scientific article; zbMATH DE number 1752544