ParaSCIP: A Parallel Extension of SCIP

作者: Yuji Shinano , Tobias Achterberg , Timo Berthold , Stefan Heinz , Thorsten Koch

DOI: 10.1007/978-3-642-24025-6_12

关键词:

摘要: Mixed integer programming (MIP)has become one of the most important techniques in Operations Research and Discrete Optimization. SCIP (Solving Constraint Integer Programs) is currently fastest non-commercial MIP solvers. It based on branchandboundprocedure which problem recursively split into smaller subproblems, thereby creating a so-called branching tree. We present ParaSCIP, an extension SCIP, realizes parallelization distributed memory computing environment. ParaSCIP uses solvers as independently running processes to solve subproblems (nodes tree) locally. This makes development independent development. Thus, directly profits from any algorithmic progress future versions SCIP. Using first implementation we were able two previously unsolved instances MIPLIB2003, standard test set library for For these computations, used up 2048 cores HLRN II supercomputer.

参考文章(11)
T.K. Ralphs, L. Lad�nyi, M.J. Saltzman, Parallel branch, cut, and price for large-scale discrete optimization Mathematical Programming. ,vol. 98, pp. 253- 280 ,(2003) , 10.1007/S10107-003-0404-8
Tobias Achterberg, SCIP: solving constraint integer programs Mathematical Programming Computation. ,vol. 1, pp. 1- 41 ,(2009) , 10.1007/S12532-008-0001-1
Robert Bixby, Edward Rothberg, Progress in computational mixed integer programming—A look back from the other side of the tipping point Annals of Operations Research. ,vol. 149, pp. 37- 41 ,(2007) , 10.1007/S10479-006-0091-Y
Manfred Padberg, Giovanni Rinaldi, A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems SIAM Review. ,vol. 33, pp. 60- 100 ,(1991) , 10.1137/1033004
Alexander Shapiro, On complexity of multistage stochastic programs Operations Research Letters. ,vol. 34, pp. 1- 8 ,(2006) , 10.1016/J.ORL.2005.02.003
Yuji Shinano, Tobias Achterberg, Tetsuya Fujie, A Dynamic Load Balancing Mechanism for New ParaLEX international conference on parallel and distributed systems. pp. 455- 462 ,(2008) , 10.1109/ICPADS.2008.75
Richard Laundy, Michael Perregaard, Gabriel Tavares, Horia Tipi, Alkis Vazacopoulos, Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study Informs Journal on Computing. ,vol. 21, pp. 304- 313 ,(2009) , 10.1287/IJOC.1080.0293
Y. Xu, T. K. Ralphs, L. Ladányi, M. J. Saltzman, Computational Experience with a Software Framework for Parallel Integer Programming Informs Journal on Computing. ,vol. 21, pp. 383- 397 ,(2009) , 10.1287/IJOC.1090.0347
Tobias Achterberg, Constraint Integer Programming pp. 1- 412 ,(2007) , 10.14279/DEPOSITONCE-1634
Richard M. Karp, Reducibility Among Combinatorial Problems. Complexity of Computer Computations. pp. 85- 103 ,(1972)