DECOMP

Introduction

DECOMP a generic framework that will allow users to easily implement a wide range of decomposition algorithms, as well as switch easily between them. The user has only to provide a partition of the constraints and a solver for the appropriate relaxation and any of the decomposition algorithms are easily employed.


DECOMP Availability

DECOMP course can be viewed at its COR@L project page. It is currently not available for download. In future it will be distributed open source through Coin-OR.


Related publications/presentations

T.K.R. and M. Galati, Decomposition and Dynamic Cut Generation in Integer Programming, to appear in Mathematical Programming (2005) (Working paper version: PS PDF) (Extended abstract: PS PDF).

T.K.R. and M. Galati, Decomposition in Integer Programming, to appear in Integer Programming: Theory and Practice, John Karlof, ed. (2005) (Working paper version: PS PDF).