In this paper, several problem reduction techniques are discussed that can be used to reduce the solution time of set partitioning problems. These techniques can be applied in any solution algorithm for set partitioning problems. Besides a short review of the existing literature on preprocessing set partitioning problems, we also present several new techniques. The value of these techniques is illustrated by various computational experiments.
|Place of Publication||Tilburg|
|Number of pages||21|
|Publication status||Published - 2003|
|Name||CentER Discussion Paper|
- general equilibrium
- incomplete markets
- financial markets