Problem Reduction in Set Partitioning Problems

M.G.C. van Krieken, H.A. Fleuren, M.J.P. Peeters

Research output: Working paperDiscussion paperOther research output

330 Downloads (Pure)


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.
Original languageEnglish
Place of PublicationTilburg
PublisherOperations research
Number of pages21
Publication statusPublished - 2003

Publication series

NameCentER Discussion Paper


  • algorithm
  • problem reducing


Dive into the research topics of 'Problem Reduction in Set Partitioning Problems'. Together they form a unique fingerprint.

Cite this