Abstract
In this paper, we introduce a new method of parallelizing a MIP (Mixed Integer Programming) solver. This method is different from a standard implementation that constructs a parallel branch-and-cut algorithm from scratch (except using an LP solver). The MIP solver we use is ILOG-CPLEX MIP Optimizer (Version 8.0), which is one of the most efficient implementations of branch-and-cut algorithms. The parallelization of the solver is performed by using the software tool PUBB2 developed by the authors. We report a part of our computational experience using up to 24 processors. In addition, we point out some problems that should be resolved for a more efficient parallelization.
This work was partially supported by MEXT in Japan through Grants-in-Aid (13680511).
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Applegate, D., Bixby, R., Chvátal, V., Cook, W.: On the Solution of Traveling Salesman Problems. Doc. Math. J. DMV Extra Volume ICM III, 645–656 (1998)
Bixby, R.E., Cook, W., Cox, A., Lee, E.K.: Computational Experience with Parallel Mixed Integer Programming in a Distributed Environment. Ann. Oper. Res. 90, 19–43 (1999)
Eckstein, J.: Parallel Branch-and-Bound Algorithms for General Mixed Integer Programming on the CM-5. SIAM J. Optim. 4, 794–814 (1998)
Eckstein, J., Phillps, C.A., Hart, W.E.: PICO: An Object-Oriented Framework for Parallel Branch and Bound. RUTCOR Research Report 40-2000, Rutgers University (2000)
ILOG CPLEX 8.0 Reference Manual, ILOG (2002)
Martin, A.: General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms. In: Jünger, M., Naddef, D. (eds.) Computational Combinatorial Optimization. LNCS, vol. 2241, p. 1. Springer, Heidelberg (2001)
Nemhauser, G.L., Wolsey, L.A.: Integer Programming and Combinatorial Optimization. John Wiley & Sons, New York (1988)
Ralphs, T.K., Ladányi, L., Esö, M.: SYMPHONY 3.0 User’s Manual (2001), available at http://www.branchandcut.org/SYMPHONY
Ralphs, T.K., Ladányi, L.: COIN/BCP User’s Manual (2001), available at http://www-124.ibm.com/developerworks/opensource/coin/documentation.html
Shinano, Y., Higaki, M., Hirabayashi, R.: A Generalized Utility for Parallel Branch and Bound Algorithms. In: Proceedings of the Seventh IEEE Symposium of Parallel and Distributed Processing, pp. 392–401 (1995)
Shinano, Y., Kounoike, Y., Fujie, T.: PUBB2: A Redesigned Object-Oriented Software Tool for Implementing Parallel and Distributed Branch-and-Bound Algorithms. Working Paper, Department of Computer, Information and Communication Sciences, Tokyo University of Agriculture and Technology (2001)
Wolsey, L.A.: Integer Programming. John Wiley & Sons, New York (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shinano, Y., Fujie, T., Kounoike, Y. (2003). Effectiveness of Parallelizing the ILOG-CPLEX Mixed Integer Optimizer in the PUBB2 Framework. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds) Euro-Par 2003 Parallel Processing. Euro-Par 2003. Lecture Notes in Computer Science, vol 2790. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45209-6_67
Download citation
DOI: https://doi.org/10.1007/978-3-540-45209-6_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40788-1
Online ISBN: 978-3-540-45209-6
eBook Packages: Springer Book Archive