The multiple-robot assembly plan problem

DOI10.1007/BF01258212zbMath0875.68988OpenAlexW1972702182MaRDI QIDQ685191

Shimon Y. Nof, Zvi Drezner

Publication date: 30 September 1993

Published in: Journal of Intelligent \& Robotic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01258212

Mathematics Subject Classification ID

Computing methodologies and applications (68U99)

Cites Work

• Unnamed Item
• A characterization of linear admissible transformations for the m- travelling salesmen problem: A result of Berenguer
• A characterization of linear admissible transformations for the m- travelling salesmen problem
• Integer Programming Formulation of Traveling Salesman Problems
• The p-Centre Problem-Heuristic and Optimal Algorithms
• Coordination of Robots Sharing Assembly Tasks
• Location-Allocation Problems
• Technical Note—A Note on the Multiple Traveling Salesmen Problem
• A restricted Lagrangean approach to the traveling salesman problem
• Properties and Solution Methods for Large Location-Allocation Problems
• Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges
• Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
• Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem
• Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost

This page was built for publication: The multiple-robot assembly plan problem