Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel
- 1 October 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (5) , 849-869
- https://doi.org/10.1137/0217053
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The Euclidean travelling salesman problem is NP-completeTheoretical Computer Science, 1977
- Augmentation ProblemsSIAM Journal on Computing, 1976
- On the complexity of edge traversingJournal of the ACM, 1976