Profit-based latency problems on the line

Operations Research Letters

Volumn 36, Issue 3, 2008, Pages 333-337

  Coene, Sofie ^a   Spieksma, Frits C R ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Complexity; Dynamic programming; Minimum latency; Traveling repairman

Indexed keywords

COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; EARNINGS;

LATENCY PROBLEMS; TRAVELING REPAIRMAN;

PROBLEM SOLVING;

EID: 43049111087     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2007.11.001     Document Type: Article

References (15)

1. Afrati F., Cosmadakis S., Papadimitriou C.H., Papageorgiou G., and Papakostantinou N. The complexity of the traveling repairman problem. Informatique Théorique et Applications 20 (1986) 79-87
2. Averbakh I., and Berman O. Routing and location-routing p-deliverymen problems on a path. Transportation Science 28 (1994) 162-166
3. A. Blum, P. Chalasani, D. Coppersmith, B. Pulleyblank, P. Raghavan, M. Sudan, The minimum latency problem, in: Proceedings of the Twenty-sixth Annual ACM Symposium on the theory of Computing, STOC, 1994, pp. 163-171
4. de Paepe W.E., Lenstra J.K., Sgall J., Sitters R.A., and Stougie L. Computer-aided complexity classification of dial-a-ride problems. INFORMS Journal on Computing 16 (2004) 120-132
5. Feillet D., Dejax P., and Gendreau M. Traveling salesman problems with profits. Transportation Science 39 (2005) 188-205
6. Friese P., and Rambau J. Online-optimization of multi-elevator transport systems with reoptimization algorithms based on set-partitioning models. Discrete Applied Mathematics 154 (2006) 1908-1931
7. García A., Jodrá P., and Tejel J. A note on the traveling repairman problem. Networks 40 (2002) 27-31
8. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-completeness (1979), Freeman, San Francisco
9. Minieka E. The delivery man problem on a tree network. Annals of Operations Research 18 (1989) 261-266
10. Psaraftis H.N., Solomon M.M., Magnanti T.L., and Kim T. Routing and scheduling on a shoreline with release times. Management Science 36 (1990) 212-223
11. Sitters R. The minimum latency problem is NP-hard for weighted trees. Proceedings of the Ninth International Conference on Integer Programming and Combinatorial Optimization, IPCO. LNCS vol. 2337 (2002) 230-239
12. R. Sitters, Complexity and Approximation in Routing and Scheduling, Ph.D. Thesis, Technical University Eindhoven, 2004
13. Wu B.Y. Polynomial time algorithms for some minimum latency problems. Information Processing Letters 75 (2000) 225-229
14. Wu B.Y., Huang Z., and Zhan F. Exact algorithms for the minimum latency problem. Information Processing Letters 92 (2004) 303-309
15. Yu W., Hoogeveen H., and Lenstra J.K. Minimizing makespan in a two-machine flow shop with delays and unit-time operations is NP-hard. Journal of Scheduling 7 (2004) 333-348