Author:
Turpin Matthew,Mohta Kartik,Michael Nathan,Kumar Vijay
Publisher
Springer Science and Business Media LLC
Reference34 articles.
1. Burkard, R. E., & Rendl, F. (1991). Lexicographic bottleneck problems. Operations Research Letters, 10(5), 303–308.
2. Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271.
3. Enright, J., & Wurman, P. R. (2011). Optimization and coordinated autonomy in mobile fulfillment systems. In Automated action planning for autonomous mobile robots.
4. Erdmann, M., & Lozano-Perez, T. (1987). On multiple moving objects. Algorithmica, 2(1–4), 477–521.
5. Fredman, M. L., & Tarjan, R. E. (1987). Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM (JACM), 34(3), 596–615.
Cited by
55 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献