DIP (Decomposition for Integer Programming) is an open-source extensible software framework for implementing decomposition-based bounding algorithms for use in solving large-scale discrete optimization problems. The framework provides a simple API for experimenting with various decomposition-based algorithms, such as Dantzig-Wolfe decomposition, Lagrangian relaxation, and various cutting plane methods. Given a compact formulation and a relaxation, the framework takes care of all algorithmic details associated with implementing any of a wide range of decomposition-based algorithms, such as branch and cut, branch and price, branch and cut and price, subgradient-based Lagrangian relaxation, branch and relax and cut, and decompose and cut. The user can specify customizations, such as methods for generating valid inequalities and branching, in terms of the variables of the compact formulation, without having to worry about the details of any required reformulations. DIP is used in combination with CHiPPS, which provides the underlying tree search methodology. DIP does not currently have extensive documentation, but the design and implementation of DIP are described in more detail in Chapter 4 of the doctoral dissertation of Matthew Galati (linked below) and the thoery behind DIP is described in both of the following below links. M. Galati, Decomposition in Integer Linear Programming, Doctoral Dissertation, Lehigh University, December 2009. T.K. Ralphs and M. Galati, Decomposition in Integer Programming, in Integer Programming: Theory and Practice, John Karlof, ed. (2005), 57-110.
Keywords for this software
References in zbMATH (referenced in 7 articles )
Showing results 1 to 7 of 7.
- Bergner, Martin; Caprara, Alberto; Ceselli, Alberto; Furini, Fabio; Lübbecke, Marco E.; Malaguti, Enrico; Traversi, Emiliano: Automatic Dantzig-Wolfe reformulation of mixed integer programs (2015)
- Wang, Jiadong; Ralphs, Ted: Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization (2013)
- Nishi, Tatsushi; Hiranaka, Yuichiro; Grossmann, Ignacio E.: A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles (2011)
- Burke, Edmund K.; Mareček, Jakub; Parkes, Andrew J.; Rudová, Hana: Decomposition, reformulation, and diving in university course timetabling (2010)
- Ralphs, Ted K.; Galati, Matthew V.: Decomposition in integer linear programming (2006)
- Ralphs, Ted K.; Galati, Matthew V.: Decomposition and dynamic cut generation in integer linear programming (2006)
- Lucena, Abilio: Non delayed relax-and-cut algorithms (2005)