Solution of a Min-Max Vehicle Routing Problem

References

• Anstreicher K., Brixius N., Goux J. P., Linderoth J. Solving large quadratic assignment problems on computational grids. Mathematical Programming (2001) . ForthcomingGoogle Scholar
• Applegate D., Bixby R., Chvátal V., Cook W. On the solution of traveling salesman problems. Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung, International Congress of Mathematicians (1998) 645–656Crossref, Google Scholar
• Applegate D., Bixby R., Chvátal V., Cook W., Jünger M., Naddef D. TSP cutswhich do not conform to the template paradigm. Computational Combinatorial Optimization (2001) (Springer, Heidelberg, Germany) . ForthcomingCrossref, Google Scholar
• Aarts E. H. L., Hurkens C. A. J., Lenstra J. K., Ball M., Hunt J. C. R. Whizzkids: two exercises in computational discrete optimization. ICIAM 99: Proceedings of the Fourth International Congress on Industrial & Applied Mathematics, Edinburgh (2000) (Oxford University Press, Oxford, U.K) 141–152Crossref, Google Scholar
• Augerat P., Belenguer J. M., Benavent E., Corberán A., Naddef D. Separating capacity constraints in the CVRP using tabu search. European Journal of Operational Research (1998) 106:546–557Crossref, Google Scholar
• Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L.Network Routing (1995) (Elsevier Science, Amsterdam, The Netherlands) Google Scholar
• Blasum U., Hochstättler W. Application of the branch and cut method to the vehicle routing problem. (2000) . Technical Report zpr2000-386, Zentrum für Angewandte Informatik Köln, Köln, GermanyGoogle Scholar
• Clochard J-M., Naddef D., Rinaldi G., Wolsey L. Using path inequalities in a branch and cut code for the symmetric traveling salesman problem. Third IPCO Conference (1993) (CIACO, Louvain-la-Neuve, Belgium) 291–311Google Scholar
• Cook W., Rich J. L. A parallel cutting-plane algorithm for the vehicle routing problem with time windows. (1999) . Technical Report TR99-04, Computational and Applied Mathematics, Rice University, Houston, TXGoogle Scholar
• Dantzig G., Fulkerson R., Johnson S. Solution of a large-scale traveling salesman problem. Operations Research (1954) 2:393–410Link, Google Scholar
• Dantzig G. B., Ramser J. H. The truck dispatching problem. Management Science (1959) 6:80–91Link, Google Scholar
• Dash S. (2000) . http://www.caam.rice.edu/~sanjeebd/software/karger.tar.gzGoogle Scholar
• Golden B. L., Assad A. A.Vehicle Routing: Methods and Studies (1988) (Elsevier Science, Amsterdam, The Netherlands) Google Scholar
• Eckstein J., Phillips C. A., Hart W. E., Butnariu D., Censor Y., Reich S. PICO: an object-oriented framework for parallel branch and bound. Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications. Studies in Computational Mathematics (2001) 8(Elsevier Science, Amsterdam, The Netherlands) 219–265Crossref, Google Scholar
• Held M., Karp R. M. The traveling salesman problem and minimum spanning trees. Part II. Mathematical Programming (1971) 1:6–25Crossref, Google Scholar
• Hemel T., van Erk S., Jenniskens P. The Manhattan Project. (1996) . http://www.win.tue.nl/whizzkids/1996/tsp.htmlGoogle Scholar
• Hurkens C. Presented at the. 1997 INFORMS National Meeting in Dallas, Texas (1997) . in a tutorial lecture by J. K. Lenstra, Session SE28Google Scholar
• Jünger M., Reinelt G., Rinaldi G., Ball M. O., Magnanti T., Monma C. L., Nemhauser G. The traveling salesman problem. Handbooks in Operations Research and Management Science (1995) 7(Elsevier Science, Amsterdam, The Netherlands) 225–330Crossref, Google Scholar
• Karger D. R. Global min-cuts inR.N.Cand other ramifications of a simple mincut algorithm. Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms (1993) (ACMSIAM, Philadelphia, Pennsylvania) 84–93Google Scholar
• Karger D. R., Stein C. An Õ(n2) algorithm for minimum cuts. Proceedings of the 25th ACM Symposium on the Theory of Computing (1993) (ACM Press, New York) 757–765Crossref, Google Scholar
• Kohl N. J., Desrosiers J., Madsen O. B. G., Solomon M. M., Soumis F. k-Path cutsfor the vehicle routing problem with time windows. (1997) . Technical Report IMM-REP-1997-12, Institute of Mathematical Modelling, Technical University of Denmark, Lyngby, DenmarkGoogle Scholar
• Laporte G., Nobert Y., Desrochers M. Optimal routing under capacity and distance restrictions. Operations Research (1985) 33:1050–1073Link, Google Scholar
• Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. B.The Traveling Salesman Problem (1985) (Wiley, Chichester, U.K) Google Scholar
• Martin O., Otto S. W., Felten E. W. Large-step Markov chains for the TSP incorporating local search heuristics. Operations Research Letters (1992) 11:219–224Crossref, Google Scholar
• Naddef D., Toth P., Vigo D. Polyhedral theory and branch-and-cut algorithms for the symmetric TSP. The Vehicle Routing Problem (2001) (SIAM, Philadelphia, PA) . ForthcomingGoogle Scholar
• Nemhauser G. L., Wolsey L. A.Integer and Combinatorial Optimization (1988) (Wiley, New York) Crossref, Google Scholar
• Ralphs T. K. Branch cut and price software: SYMPHONY. (2001) . http://www.branchandcut.org/SYMPHONY/Google Scholar
• Ralphs T. K., Kopman L., Pulleyblank W. R., Trotter L. E. On the capacitated vehicle routing problem. Mathematical Programming (2001) . ForthcomingGoogle Scholar
• Toth P., Vigo D.The Vehicle Routing Problem (2001) (SIAM, Philadelphia, PA) Google Scholar
• Whizzkids '96 (1996) . http://www.win.tue.nl/whizzkids/1996/index.htmlGoogle Scholar
• Wolsey L. A.Integer Programming (1998) (Wiley, New York) Google Scholar