Parallel Branch and Cut

Parallel Combinatorial Optimization

Volumn , Issue , 2006, Pages 53-101

  Ralphs, T K ^a  

^a Lehigh University   (United States)

Author keywords

Algorithms SYMPHONY and ALPS; Branch and cut algorithm and mixed integer linear programs (MILPs); Parallelizing branch and cut

Indexed keywords

EID: 38449101871     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470053928.ch3     Document Type: Chapter

References (70)

1. J.J.H. Forrest, J.P.H. Hirst, and J.A. Tomlin. Practical solution of large scale mixed integer programming problems with UMPIRE. Manag. Sci., 20:736-773 (1974).
2. G. Mitra. Investigation of some branch and bound strategies for the solution of mixed integer linear programs. Math. Prog., 4:155-170 (1973).
3. M. Bénichou et al. Experiments in mixed-integer linear programming. Math. Prog. 1:76-94 (1971).
4. J.T. Linderoth and M.W.P. Savelsbergh. A computational study of search strategies in mixed integer programming. INFORMS J. Comput., 11:173-187 (1999).
5. M. Padberg and G. Rinaldi. A Branch-and-Cut Algorithm for the Resolution of Large-Scale Traveling Salesman Problems. SIAM Rev., 33:60+ (1991).
6. G.L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization, John Wiley & Sons, Inc., New York, 1988.
7. M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1:169-197 (1981).
8. G.L. Nemhauser and L.A. Wolsey. Integer and Combinatorial Optimization. 1st ed. John Wiley & Sons, Inc., 1988.
9. T.K. Ralphs. SYMPHONY Version 4.0 User's Manual. Technical Report 03T-006, Lehigh University Industrial and Systems Engineering, 2003.
10. L. Ladányi. Parallel Branch and Cut and Its Application to the Traveling Salesman Problem. Ph.D. thesis, Cornell University, May 1996.
11. J.M. Gauthier and G. Ribière. Experiments in mixed-integer linear programming using pseudocosts. Math. Prog., 12:26-47 (1977).
12. T. Achterberg, T. Koch, and A. Martin. Branching rules revisited. Oper. Res. Lett., 33:42-54 (2004).
13. M. Cosnard and D. Trystram. Parallel Algorithms and Arcitectures. International Thomson Computer Press, Boston, MA, 1995.
14. R.G. Brown. Engineering a beowulf-style compute cluster. Available at http://www.phy.duke.edu/~rgb/Beowulf/Beowulf_book/Beowulf_book/, 2004.
15. A. Geist et al. PVM: Parallel Virtual Machine. The MIT Press, Cambridge, MA, 1994.
16. W. Gropp, E. Lusk, and A. Skjellum. Using MPI. 2nd ed., MIT Press, Cambridge, MA, 1999.
17. A. de Bruin, G.A.P. Kindervater, and H.W.J.M. Trienekens. Asynchronous parallel branch and bound and anomolies. Report EUR-CS-95-05, Erasmus University, Rotterdam, 1995.
18. T.H. Lai and S. Sahni. Anomalies in parallel branch and bound algorithms. Proceedings of the 1983 International Conference on Parallel Processing, 1983, pp. 183-190.
19. G.M. Amdahl. Validity of the single-processor approach to achieving large-scale computing capabilities. AFIPS Conference Proceedings, AFIPS Press, 1967, pp. 483-485.
20. V. Kumar and A. Gupta. Analyzing scalability of parallel algorithms and architectures. J. Parallel Distributed Comput., 22:379-391 (Sept. 1994).
21. A.Y. Grama and V. Kumar. Parallel search algorithms for discrete optimization problems. ORSA J. Comput., 7:365-385 (1995).
22. J.L. Gustafson. Reevaluating Amdahl's Law. Commun. ACM, 31:532-533 (1988).
23. V. Kumar and V.N. Rao. Parallel depth-first search, part II: Analysis. Int. J. Parallel Prog., 16:501-519 (1987).
24. H.W.J.M. Trienekens and A. de Bruin. Towards a taxonomy of parallel branch and bound algorithms. Technical Report EUR-CS-92-01, Department of Computer Science, Erasmus University, 1992.
25. A.H. Land and A.G. Doig. An automatic method for solving discrete programming problems. Econometrica, 28:497-520 (1960).
26. L.G. Mitten. Branch-and-bound methods: General formulation and properties. Oper. Res., 18:24-34 (1970).
27. L. Hafer. bonsaiG 2.8, 2004. Available at http://www.cs.sfu.ca/~lou/BonsaiG/dwnldreq.html.
28. J. Forrest. CBC, 2004. Available at http://www.coin-or.org/.
29. A. Makhorin. GLPK 4.2, 2004. Available at htpp://www.gnu.org/software/glpk/glpk.htmol.
30. M. Berkelaar. lp_solve 5.1, 2004. Available at http://groups.yahoo.com/group/lp_solve/.
31. G.L. Nemhauser, M.W.P. Savelsbergh, and G.S. Sigismondi. MINTO, a Mixed INTeger Optimizer. Oper. Res. Lett., 15:47-58 (1994).
32. T.K. Ralphs. SYMPHONY Version 5.0 user's manual. Technical Report 04-T011, Lehigh University Industrial and Systems Engineering, 2004.
33. T.K. Ralphs and M. Guzelsoy. The SYMPHONY callable library for mixed-integer linear programming. Proceedings of the Ninth INFORMS Computing Society Conference, 2005, pp. 61-76.
34. T.K. Ralphs and L. Ladányi. COIN/BCP User's Manual, 2001. Available at http://www.coin-or.org.
35. M. Jünger and S. Thienel. The ABACUS system for branch and cut and price algorithms in integer programming and combinatorial optimization. Software Practice Exp., 30:1325-1352 (2001).
36. D. Applegate, R. Bixby, V. Chvátal, and W. Cook. On the solution of traveling salesman problems. Documenta Mathematica, Extra Volume Proceedings ICM III (1998) 1998, pp. 645-656.
37. D. Applegate, R. Bixby, V. Chvátal, and W. Cook. CONCORDE TSP solver. Available at http://www.tsp.gatech.edu/concorde.html.
38. Y. Shinano, K. Harada, and R. Hirabayashi. A generalized utility for parallel branch and bound algorithms. Proceedings of the 1995 Seventh Symposium on Parallel and Distributed Processing, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 392-401.
39. M. Benchouche et al. Building a parallel branch and bound library. In Solving Combinatorial Optimization Problems in Parallel, Lecture Notes in Computer Science 1054, Springer, Berlin, 1996, p. 201.
40. S. Tschoke and T. Polzer. Portable Parallel Branch and Bound Library User Manual: Library Version 2.0. Department of Computer Science, University of Paderborn.
41. J. Eckstein, C.A. Phillips, and W.E. Hart. PICO: An object-oriented framework for parallel branch and bound. Technical Report RRR 40-2000, Rutgers University, 2000.
42. J. Linderoth. Topics in Parallel Integer Optimization. Ph.D. thesis, School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, 1998.
43. Q. Chen and M. Ferris. Fatcop: A fault tolerant condor-pvm mixed integer programming solver. SIAM J. Opn., 11(4):1019-1036 (2001).
44. V. Chvátal. Linear Programming. W.H. Freeman and Company, New York, 1983.
45. B. Gendron and T.G. Crainic. Parallel branch and bound algorithms: Survey and synthesis. Oper. Res., 42:1042-1066 (1994).
46. B. Borbeau, T.G. Crainic, and B. Gendron. Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem. Parallel Comput., 26:27-46 (2000).
47. J.J.H. Forrest, J.P.H. Hirst, and J.A. Tomlin. Practical solution of large scale mixed integer programming pr oblems with UMPIRE. Manag. Sci., 20:736-773 (1974).
48. C. Fonlupt, P. Marquet, and J. Dekeyser. Data-parallel load balancing strategies. Parallel Comput., 24(11):1665-1684 (1998).
49. D. Henrich. Initialization of parallel branch-and-bound algorithms. In Second International Workshop on Parallel Processing for Artificial Intelligence (PPAI-93), August, 1993.
50. V. Kumar, A.Y. Grama, and Nageshwara Rao Vempaty. Scalable load balancing techniques for parallel computers. J. Parallel Distributed Comput., 22(1):60-79 (1994).
51. P.S. Laursen. Can parallel branch and bound without communication be effective? SIAM J. Op., 4:33-33 (May, 1994).
52. P. Sanders. Tree shaped computations as a model for parallel applications, 1998. In ALV198 workshop on afflication balancing pp. 123-123.
53. A. Sinha and L.V. Kalé. A load balancing strategy for prioritized execution of tasks. Seventh International Parallel Processing Symposium, Newport Beach, CA., April 1993, pp. 230-237.
54. T.K. Ralphs. Parallel Branch and Cut for Vehicle Routing. Ph.D. thesis, Cornell University, 1995.
55. COIN-OR: Computational Infrastructure for Operations Research, 2004. Available at http://www.coin-or.org.
56. T.K. Ralphs. SYMPHONY 5.0, 2004. Available at http://www.branchandcut.org/SYMPHONY/.
57. T.K. Ralphs, L. Ladányi, and M.J. Saltzman. A library hierarchy for implementing scalable parallel search algorithms. J. Supercomput., 28:215-234 (2004).
58. Y. Xu, T.K. Ralphs, L. Ladányi, and M.J. Saltzman. ALPS: A framework for implementing parallel search algorithms. Proceedings of the Ninth INFORMS Computing Society Conference, 2005, pp. 319-334.
59. T.K. Ralphs, L. Ladányi, and M.J. Saltzman. A library hierarchy for implementing scalable parallel search algorithms. J. Supercomput., 28:215-234 (2004).
60. H.W.J.M. Trienekens and A. de Bruin. Towards a taxonomy of parallel branch and bound algorithms. Report EUR-CS-92-01, Erasmus University, Rotterdam, 1992.
61. R.E. Bixby, S. Ceria, C.M. McZeal, and M.W.P. Savelsbergh. An updated mixed integer programming library: MIPLIB 3.0. Optima, 58:12-15 (1998).
62. A. Martin, T. Achterberg, and T. Koch. MIPLIB 2003. Avaiable at http://miplib.zib.de.
63. J.T. Linderoth. MIP instances, 2004. Available at http://coral.ie.Lehigh.edu/mip-instances.
64. G.B. Danzig and R.H. Ramser. The truck dispatching problem. Manag. Sci., 6:80-91 (1959).
65. T.K. Ralphs. Library of vehicle routing problem instances. Available at http://branchandcut.org/VRP/data.
66. T.K. Ralphs. Symphony vehicle routing problem solver. Available at http://branchandcut.org/vap/
67. T.K. Ralphs. Parallel branch and cut for capacitated vehicle routing. Parallel Comput., 29:607-629 (2003).
68. M. Esö. Parallel Branch and Cut for Set Partitioning. Ph.D. thesis, Department of Operations Research and Industrial Engineering, Cornell University, 1999.
69. M. Esö and T.K. Ralphs. Symphony set partitioning problem solver. Available at http://branchandcut.org/spp/
70. J.T. Linderoth. Topics in Parallel Integer Optimization. Ph.D. thesis, Georgia Institute of Technology, 1998.