1. Cook W, Rich JL (1999) A parallel cutting-plane algorithm for the vehicle routing problem with time windows. Computational and Applied Mathematics Department. Rice University, Houston, TX, Technical Report
2. industriel ÉpDdg, Houck D (1978) The traveling salesman problem as a constrained shortest path problem: theory and computational experience. Ecole polytechnique de Montréal, Montréal, Canada
3. Kohl N, Madsen OB (1997) An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation. Oper Res 45(3):395–406
4. Larsen J (1999) Parallelization of the vehicle routing problem with time windows. Technical University of DenmarkDanmarks Tekniske Universitet, Department of Informatics and Mathematical ModelingInstitut for Informatik og Matematisk Modellering
5. Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326–329