Abstract
Branch-and-bound algorithms for Mixed-Integer Programs (MIP) are studied for over 40 years [1, 3, 7]. Object-oriented frameworks for parallel branch-and-bound algorithms like ALPS [9], ParaSCIP [8], and PICO [5] are well known. Our aim is to develop a powerful yet easy-to-use parallel MIP-solver by combining open-source tools or frameworks that are platform independent and free of charge so that even small companies come to the benefit of an optimization suite. Licenses of commercial solvers like CPLEX or GUROBI are often not affordable for small companies. Our tool combines the Gnu Linear Programming Kit (GLPK) and the remote procedure call framework Thrift. To make our development independent of the GLPK-development, we use the GLPK-solvers as independently running processes. So we are able to profit from further development and algorithmic progress of GLPK in future. We describe how to combine these technologies to get an optimization suite for mid-sized problems and evaluate the power of our tool by solving some benchmark data from Chu and Beasley [4] and MIPLIB 2003 [2].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett. 33, 42–54 (2005)
Achterberg, T., Koch, T., Martin, A.: MIPLIB 2003. Oper. Res. Lett. 34(4), 361–372 (2006)
Benichou, M., Gauthier, J., Girodet, P., Hentges, G., Ribiere, G., Vincent, O.: Experiments in mixed-integer linear programming. Math. Program. 1, 76–94 (1971)
Chu, P., Beasley, J.: A genetic algorithm for the multidimensional knapsack problem. J. Heurist. 4(1), 63–86 (1998)
Eckstein, J., Phillips, C.A., Hart, W.E.: Pico: An object-oriented framework for parallel branch and bound. In: Dan Butnariu, Y.C., Reich, S. (eds.) Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, Studies in Computational Mathematics, vol. 8, pp. 219–265. Elsevier (2001)
Garey, M., Johnson, D.: Comput. Intractability. W.H. Freeman and Company, San Francisco (1979)
Linderoth, J., Savelsbergh, M.: A computational study of search strategies for mixed integer programming. INFORMS J. Comput. 11(2), 173–187 (1999)
Shinano, Y., Achterberg, T., Berthold, T., Heinz, S., Koch, T.: ParaSCIP: A parallel extension of SCIP. In: Bischof, C., Hegering, H.G., Nagel, E.W., Wittum, G. (eds.) Competence in High Performance Computing, June 2010, pp. 135–148. Springer, Berlin (2012)
Xu, Y., Ralphs, T.K., Ladányi, L., Saltzman, M.J.: Alps: A framework for implementing parallel tree search algorithms. In: Golden, B., Raghavan, S., Wasil, E. (eds.) The Next Wave in Computing, Optimization, and Decision Technologies, pp. 319–334. Springer, US (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Gurski, F., Rethmann, J. (2018). Distributed Solving of Mixed-Integer Programs with GLPK and Thrift. In: Fink, A., Fügenschuh, A., Geiger, M. (eds) Operations Research Proceedings 2016. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-55702-1_79
Download citation
DOI: https://doi.org/10.1007/978-3-319-55702-1_79
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55701-4
Online ISBN: 978-3-319-55702-1
eBook Packages: Business and ManagementBusiness and Management (R0)