On-line single-server dial-a-ride problems
暂无分享,去创建一个
[1] Ricardo A. Baeza-Yates,et al. Searching in the Plane , 1993, Inf. Comput..
[2] David P. Williamson,et al. Scheduling parallel machines on-line , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[3] Eugene L. Lawler,et al. Sequencing and scheduling: algorithms and complexity , 1989 .
[4] Greg N. Frederickson,et al. Nonpreemptive Ensemble Motion Planning on a Tree , 1993, J. Algorithms.
[5] Martin Grötschel,et al. Combinatorial Online Optimization in Practice , 1998 .
[6] Martin W. P. Savelsbergh,et al. The General Pickup and Delivery Problem , 1995, Transp. Sci..
[7] Madhu Sudan,et al. The minimum latency problem , 1994, STOC '94.
[8] Mikhail J. Atallah,et al. Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel , 1988, SIAM J. Comput..
[9] Chul E. Kim,et al. Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).
[10] Apa Arjen Vestjens. On-line machine scheduling , 1997 .
[11] Greg N. Frederickson,et al. Preemptive Ensemble Motion Planning on a Tree , 1992, SIAM J. Comput..
[12] Leen Stougie,et al. Algorithms for the On-Line Travelling Salesman1 , 2001, Algorithmica.
[13] L. Bodin. ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .
[14] Cynthia A. Phillips,et al. Scheduling Jobs that Arrive Over Time (Extended Abstract) , 1995, WADS.
[15] Moses Charikar,et al. The finite capacity dial-a-ride problem , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[16] Dih Jiun Guan,et al. Routing a Vehicle of Capacity Greater than one , 1998, Discret. Appl. Math..