### Abstract

Original language | English |
---|---|

Place of Publication | Tilburg |

Publisher | Operations research |

Number of pages | 21 |

Volume | 2003-80 |

Publication status | Published - 2003 |

### Publication series

Name | CentER Discussion Paper |
---|---|

Volume | 2003-80 |

### Fingerprint

### Keywords

- algorithm
- problem reducing

### Cite this

*Problem Reduction in Set Partitioning Problems*. (CentER Discussion Paper; Vol. 2003-80). Tilburg: Operations research.

}

**Problem Reduction in Set Partitioning Problems.** / van Krieken, M.G.C.; Fleuren, H.A.; Peeters, M.J.P.

Research output: Working paper › Discussion paper › Other research output

TY - UNPB

T1 - Problem Reduction in Set Partitioning Problems

AU - van Krieken, M.G.C.

AU - Fleuren, H.A.

AU - Peeters, M.J.P.

N1 - Pagination: 21

PY - 2003

Y1 - 2003

N2 - 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.

AB - 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.

KW - algorithm

KW - problem reducing

M3 - Discussion paper

VL - 2003-80

T3 - CentER Discussion Paper

BT - Problem Reduction in Set Partitioning Problems

PB - Operations research

CY - Tilburg

ER -