Routing problems: a historical perspective

Bibliography

• Agarwal , A , Lim , M H , Chew , C Y , Poo , T K , Er , M J and Leong , Y K . 2004 . “ ‘Solution to the fixed airbase problem for autonomous URAV site visitation sequencing’ ” . In Genetic and evolutionary computation , Springer .
   Google Scholar
• Agarwala , R , Applegate , D L , Maglott , D , Schuler , G D and Schäffer , A A . 2000 . ‘A fast and scalable radiation hybrid map construction and integration strategy’ . Genome Research , 10 : 350 – 364 .
   Google Scholar
• Applegate, D, Bixby, R, Chvátal, V, Cook, W, The German cities TSP solution. http://www.tsp.gatech.edu/, 2001
   Google Scholar
• Applegate, D, Bixby, R, Chvátal, V, Cook, W, Helsghaun, K, The Sweden cities TSP solution. http://www.tsp.gatech.edu//sweeden/cities/cities.htm, 2004
   Google Scholar
• Applegate , D , Bixby , R , Chvátal , V and Cook , W . 2006 . The Traveling Salesman Problem: a computational study , Princeton University Press .
   Google Scholar
• Avner , P , Bruls , T , Poras , I , Eley , L , Gas , S , Ruiz , P , Wiles , M V , Sousa-Nunes , R , Kettleborough , R , Rana , A , Morissette , J , Bentley , L , Goldsworthy , M , Haynes , A , Herbert , E , Southam , L , Lehrach , H , Weissenbach , J , Manenti , G , Rodriguez-Tome , P , Beddington , R , Dunwoodie , S and Cox , R D . 2001 . ‘A radiation hybrid transcript map of the mouse genome’ . Nature Genetics , 29 : 194 – 200 .
   Google Scholar
• Bailey, A C, McLain, T W, Beard, R W, ‘Fuel saving strategies for separated spacecraft snterferometry’, in Proceedings of In AIAA Guidance, Navigation, and Control Conference, 2000
   Google Scholar
• Bland , R E and Shallcross , D F . 1987 . Large Traveling Salesman Problem arising from experiments in X-ray crystallography: a preliminary report on computation , Technical Report No. 730 School of OR/IE, Cornell University .
   Google Scholar
• Bock , F . 1963 . “ ‘Mathematical programming solution of traveling salesman examples’ ” . In Recent advances in mathematical programming , Edited by: Graves , R L and Wolfe , P . McGraw-Hill .
   Google Scholar
• Bruno, G, Genovese, A, Improta, G, ‘Storia dei problemi di routing, da Eulero ai nostri giorni’, in Proceedings of the 3rd Italian Conference on Engineering History (in Italian), 2010
   Google Scholar
• Camerini , P M , Fratta , L and Maffioli , F . 1975 . ‘On improving relaxation methods by modified gradient techniques’ . Mathematical Programming Study , 3 : 26 – 34 .
   Google Scholar
• Ciriani , T A . 2001 . ‘4>15112’ . AIROnews VI , 4 : 9 – 10 .
   Google Scholar
• Clarke , G and Wright , J W . 1964 . ‘Scheduling of vehicles from a depot to a number of delivery points’ . Operations Research , 12 : 568 – 581 .
   Web of Science ®Google Scholar
• Dantzig , G , Fulkerson , R and Johnson , S . 1954 . ‘Solution of a large scale Traveling Salesman Problem’ . Journal of the Operations Research Society of America , 2 : 393 – 410 .
   Web of Science ®Google Scholar
• Dantzig , G and Ramser , J H . 1959 . ‘The Truck Dispatching Problem’ . Management Science , 6 : 80 – 91 .
   Web of Science ®Google Scholar
• [ein alter Commis-Voyageur'], Der Handlungsreisende – wie er sein soll und was er zu thun hat, um Auftrage zu erhalten und eines glucklichen Erfolgs in seinen Geschaften gewiss zu sein – Von einem alten Commis-Voyageur, B Fr Voigt, Ilmenau, 1832; reprinted Verlag Bernd Schramm, Kiel, 1981
   Google Scholar
• Euler , Leonhard . 1741 . Solutio problematis ad geometriam situs pertinentis . Commentarii Academiae Scientiarum Petropolitanae , 8 : 128 – 140 . the original text is available at http://www.math.dartmouth.edu/~euler/
   Google Scholar
• Eksioglu , B , Vural , V and Reisman , A . 2009 . ‘The vehicle routing problem: a taxonomic review’ . Computers & Industrial Engineering , 57 : 1472 – 1483 .
   Web of Science ®Google Scholar
• Gilmore , P C and Gomory , R E . 1964 . ‘Sequencing a one state-variable machine: a solvable case of the traveling salesman problem’ . Operational Research , 12 : 655 – 679 .
   Web of Science ®Google Scholar
• Golden , B L , Magnanti , T L and Nguyan , H Q . 1972 . ‘Implementing vehicle routing algorithms’ . Networks , 7 : 113 – 148 .
   Google Scholar
• Hamilton , W R . 1856 . ‘Memorandum respecting a new system of roots of unity (the Icosian calculus)’ . Philosophical Magazine , 12 : 446
   Google Scholar
• Hamilton , W R . 1858 . ‘Memorandum respecting a new system of roots of unity (the Icosian calculus)’ . Proceedings of the Royal Irish Academy , 6 : 415 – 416 .
   Google Scholar
• Kirkman , T P . 1856 . ‘On the representation of polyhedra’ . Philosophical Transactions of the Royal Society , 146 : 413 – 418 .
   Google Scholar
• Lenstra , J K and Rinnooy Kan , A H G . 1975 . ‘Some simple applications of the Travelling Salesman Problem’ . Operational Research Quarterly , 26 : 717 – 733 .
   Google Scholar
• Levin , A . 1971 . ‘Scheduling and fleet routing models for transportation systems’ . Transportation Science , 5 : 232 – 256 .
   Google Scholar
• Liebman , J C . 1970 . ‘Mathematical models for solid waste collection and disposal’ . Bulletin of the Operations Research Society , 18
   Google Scholar
• Mahalanobis , P C . 1940 . ‘A sample survey of the acreage under jute in Bengal’ . Sankhyā , 4 : 511 – 530 .
   Google Scholar
• Mallion , Roger . 2008 . ‘A contemporary Eulerian walk over the bridges of Kaliningrad’ . BSHM Bulletin , 23 : 24 – 36 .
   Google Scholar
• Mei-Ko , K . 1962 . ‘Graphic programming using odd or even points’ . Chinese Mathematics , 1 : 27 – 277 .
   Google Scholar
• Menger , K . 1932 . ‘Eine neue Definition der Bogenlange’ . Ergebnisse eines Mathematischen Kolloquiums , 2 : 11 – 12 .
   Google Scholar
• Morton , G and Land , A H . 1955 . ‘A contribution to the travelling-salesman problem’ . Journal of the Royal Statistical Society , 17 : 185 – 194 .
   Google Scholar
• Müller-Merbach , M . 1983 . ‘Zweimal travelling salesman’ . DGOR-Bulletin , 25 : 12 – 13 .
   Google Scholar
• Padberg , M and Rinaldi , G . 1991 . ‘A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems’ . SIAM Review , 33 : 60 – 100 .
   Web of Science ®Google Scholar
• Plante , R D , Lowe , T J and Chandrasekaran , R . 1987 . ‘The product matrix Traveling Salesman Problem: an application and solution heuristic’ . Operations Research , 35 : 772 – 783 .
   Web of Science ®Google Scholar
• Ratliff , H D and Rosenthal , A S . 1981 . Order-picking in a rectangular warehouse: a solvable case for the traveling salesman problem , Atlanta, , Georgia : Georgia Institute of Technology . PDRC Report Series No. 81–10
   Google Scholar
• Schrijver , A . 2003 . Combinatorial optimization: polyhedra and efficiency , Vol. 1 , Berlin Heidelberg : Springer-Verlag .
   Google Scholar
• Wilson , N H M and Sussman , J M . 1971 . Scheduling algorithms for dial-a-ride systems , MIT . Urban Systems Laboratory Report USL TR-70-13
   Google Scholar