Problem Reduction in Set Partitioning Problems

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.

MoreLess

Year of publication:	2003
Authors:	Fleuren, Hein ; van Krieken, M.G.C. ; Peeters, M.J.P.
Institutions:	Tilburg University, Center for Economic Research
Subject:	algorithm \| problem reducing

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	application/pdf
Series:	Discussion Paper.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series CentER Discussion Paper Number 2003-80
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10011096214