Visiting a network of services with time constraints

Bodin, 1983, Routing and scheduling of vehicles and crews. The state of the art, Computers and Operation Research, 10, 63, 10.1016/0305-0548(83)90030-8 Chen, 2000, Shortest path in traffic light networks, Transportation Research Part B, 34, 241, 10.1016/S0191-2615(99)00023-5 Desrochers, 1988, A generalised permanent labelling algorithm for the shortest path problem with time windows, INFOR, 26, 191 Kolen, 1987, Vehicle routing with time windows, Operations Research, 35, 266, 10.1287/opre.35.2.266 Laporte, 1995, Routing problems: a bibliography, Annals of Operations Research, 61, 227, 10.1007/BF02098290 Gallo, 1988, Shortest path algorithms, Annals of Operations Research, 13, 3 Garey MR, Johnson DS. Computer and intractability. A guide to the theory of NP-completeness. New York: Freeman, 1979.