Problem reduction in set partitioning problems

M.G.C. van Krieken, Hein Fleuren () and M.J.P. Peters
Additional contact information
M.J.P. Peters: Tilburg University, Center for Economic Research

No 80, Discussion Paper from Tilburg University, Center for Economic Research

Abstract: 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.

Keywords: problem; reducing (search for similar items in EconPapers)
Date: Written 2003

Downloads: (external link)
http://arno.uvt.nl/show.cgi?fid=4498 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Access Statistics for this paper

More papers in Discussion Paper from Tilburg University, Center for Economic Research
Series data maintained by Corry Stuyts ().