1. Balas E, Toth P (1985) Branch and bound methods for the traveling salesman problem. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (eds) The traveling salesman problem—a guided tour of combinatorial optimization. Wiley, Chichester, pp 361–401
2. Brucker P, Heitmann S, Knust S (2002) Scheduling railway traffic at a construction site. OR Spectr 24: 19–30
3. Cai X, Goh CJ, Mees AI (1998) Greedy heuristics for rapid scheduling of trains on a single track. IIE Trans 30: 481–493
4. Carey M, Carville S (2003) Scheduling and platforming trains at busy complex stations. Transp Res Part A 37: 195–224
5. Chvatal V (1985) Hamiltonian cycles. In: Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (eds) The traveling salesman problem—a guided tour of combinatorial optimization. Wiley, Chichester, pp 403–429