Abstract
Branch-and-price (BAP) algorithms based on Dantzig-Wolfe decomposition have shown great success in solving mixed integer linear optimization problems (MILPs) with specific identifiable structure. Only recently has there been investigation into the development of a “generic” version of BAP for unstructured MILPs. One of the most important elements required for such a generic BAP algorithm is an automatic method of decomposition. In this paper, we report on preliminary experiments using hypergraph partitioning as a means of performing such automatic decomposition.
NSF Grant CMMI-1130914.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Catalyurek, U.V., Aykanat, C.: Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication. IEEE Transactions on Parallel and Distributed Systems 10, 673–693 (1999)
Bergner, M., Caprara, A., Ceselli, A., Furini, F., Lübbecke, M.E., Malaguti, E., Traversi, E.: Automatic Dantzig-Wolfe reformulation of mixed integer programs, http://www.optimization-online.org/DB_FILE/2012/09/3614.pdf
Gamrath, G., Lübbecke, M.E.: Experiments with a generic Dantzig-Wolfe decomposition for integer programs. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 239–252. Springer, Heidelberg (2010)
Ralphs, T.K., Galati, M.V.: DIP (2012), https://projects.coin-or.org/Dip
Wang, J., Ralphs, T.K.: Computational experience with hypergraph-based methods for automatic decomposition in integer programming. Technical Report 12T-014, COR@L Laboratory, Lehigh University (2012), http://coral.ie.lehigh.edu/~ted/files/papers/CPAIOR12.pdf
Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: Column generation for solving huge integer programs. Operations Research 46, 316–329 (1998)
Galati, M.V.: Decomposition in Integer Programming. PhD thesis, Lehigh University (2009), http://coral.ie.lehigh.edu/~ted/files/papers/MatthewGalatiDissertation09.pdf
Vanderbeck, F.: BaPCod–a generic branch-and-price code (2005), http://wiki.bordeaux.inria.fr/realopt
Ladányi, L.: BCP: Branch-cut-price framework (2012), https://projects.coin-or.org/Bcp
Jünger, M., Thienel, S.: The ABACUS system for branch and cut and price algorithms in integer programming and combinatorial optimization. Software Practice and Experience 30, 1325–1352 (2001)
Borndörfer, R., Ferreira, C.E., Martin, A.: Decomposing matrices into blocks. SIAM Journal on Optimization 9, 236–269 (1998)
Ferris, M., Horn, J.: Partitioning mathematical programs for parallel solution. Mathematical Programming 80, 35–61 (1998)
Catalyürek, U.V., Aykanat, C.: PaToH: A multilevel hypergraph partitioning tool, version 3.0. Technical Report 6533, Bilkent University, Department of Computer Engineering (1999)
Aykanat, C., Pinar, A., Çatalyürek, Ü.V.: Permuting sparse rectangular matrices into block-diagonal form. SIAM Journal on Scientific Computing 25, 1860–1879 (2004)
Achterberg, T., Koch, T., Martin, A.: The mixed integer programming library: MIPLIB 2003 (2003), http://miplib.zib.de/miplib2003
Karypis, G., Kumar, V.: hMETIS 1.5: A hypergraph partitioning package. Technical report, Department of Computer Science, University of Minnesota (1998), http://www.cs.umn.edu/metis
Çatalyürek, Ü.V., Aykanat, C.: PaToH: partitioning tool for hypergraphs (2012), http://bmi.osu.edu/~umit/software.html
Forrest, J.J.: CLP: COIN-OR linear Programming Solver (2012), https://projects.coin-or.org/Clp
Forrest, J.J.: CBC: COIN-OR branch-and-cut solver (2012), https://projects.coin-or.org/Cbc
Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., et al.: MIPLIB 2010. Mathematical Programming Computation 3, 103–163 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, J., Ralphs, T. (2013). Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization. In: Gomes, C., Sellmann, M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2013. Lecture Notes in Computer Science, vol 7874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38171-3_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-38171-3_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38170-6
Online ISBN: 978-3-642-38171-3
eBook Packages: Computer ScienceComputer Science (R0)