Combinatorial Optimization Models Motivated by Robotic Assembly Problems

In this paper some results are summarized which were motivated by modeling the assembly of printed circuit boards using robots. First we consider an iterative traveling salesman — location model for sequencing the insertion points and locating the storage bins. The restricted location problem used in this model is generalized and some algorithms for solving this general problem are described. Finally, we discuss max-linear combinatorial optimization problems as models for multi objective problems.Emphasis will be on results obtained by the author in cooperation with various collaborators. It is not intended to give a complete overview on the literature in this area.