User menu

Time-dependent Traveling Salesman Problem - the Deliveryman Case

Bibliographic reference Lucena, A.. Time-dependent Traveling Salesman Problem - the Deliveryman Case. In: Networks (New York) : an international journal, Vol. 20, no. 6, p. 753-763 (1990)
Permanent URL http://hdl.handle.net/2078.1/51571
  1. Afrati, Theor. Inf. Appl., 20, 79 (1986)
  2. Carpaneto, Computing, 31, 83 (1983)
  3. Christofides, Networks, 11, 145 (1981)
  4. Production scheduling on parallel lines with dependencies. Ph. D. Dissertation, The Johns Hopkins University, Baltimore (1973).
  5. Fox, Operations Res., 28, 1018 (1980)
  6. Motivation and modelling. In The Travelling Salesman Problem (, , and , Eds.), Wiley, Chichester (1985).
  7. Held, Math. Program., 6, 62 (1974)
  8. Houck, OPSEARCH, 17, 93 (1980)
  9. Lin, Operations Res., 21, 498 (1973)
  10. The deliveryman problem on a tree network. Preprints ISOLDE IV (July, 1987).
  11. Travelling salesman-type combinatorial problems and their relation to the logistics of blood banking. Ph. D. Thesis, Department of Industrial Engineering and Management Sciences, Northwestern University (1976).
  12. Picard, Operations Res., 26, 86 (1978)
  13. Simchi-Levi, IEE Trans.