Author:
Augustine John E.,Seiden Steven S.
Publisher
Springer Berlin Heidelberg
Reference17 articles.
1. Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L., AND Talamo, M. Algorithms for the on-line travelling salesman. Algorithmica 29, 4 (2001), 560–581.
2. Bruno, J., AND Downey, P. Complexity of task sequencing with deadlines, setup times and changeover costs. SIAM Journal on Computing 7, 4 (Nov. 1978), 393–404.
3. Charikar, M., Motwani, R., Raghavan, P., AND Silverstein, C. Constrained TSP and low-power computing. In Proceedings of the 5th International Workshop on Algorithms and Data Structures (Aug. 1997), pp. 104–115.
4. Christofides, N. Worst-case analysis of a new heuristic for the travelling salesman problem. Tech. Rep. CS-93-13, Carnegie Mellon University, Graduate School of Industrial Administration, 1976.
5. Desrosiers, J., Dumas, Y., Solomon, M., AND Soumis, F. Time constrained routing and scheduling. In Network Routing, Volume 8 of Handbooks in Operations Research and Management Science, M. O. Ball, T. L. Magnanti, C. L. Monma, and G. L. Nemhauser, Eds. Elsevier Science, 1995.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献