For the interested reader
- Beasley J (1983) ‘Route first-cluster second methods for vehicle routeing’, Omega, 11, pp 403–408.
- Bodin L D (1990) ‘Twenty years of routeing and scheduling’, Operations Research, pp 571–579,
- Brown R and Sower W (1979) ‘Performance rating for service job’, AIIE Transaction, pp 121–128.
- Foster B and Ryan D (1976) ‘An integer programming approach to vehicle routeing and scheduling problem’, Journal of the Operational Research Society, 27, pp 367–384.
- Koskosidis et al (1992) ‘An optimization-based heuristic for vehicle routeing and scheduling with soft time window constraint’, Transportation Science, pp 69–85.
- Lin and Kernigham (1973) ‘An effective heuristic for the travelling salesman problem’, Operations Research, pp 498–516.
- Mittenthal J and Noon C (1992) ‘An insert/delete heuristic for the travelling salesman subset tour problem with one additional constraint’, Journal of the Operational Research Society, 43, pp 277–283.
- Salkin H and Mathur K (1989) Foundations of Integer Programming, North Holland Publisher, New York.