Problem Reduction in Set Partitioning Problems

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

Problem Reduction in Set Partitioning Problems

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

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

389 Downloads (Pure)

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.

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

Keywords

algorithm
problem reducing

Access to Document

80

Cite this

@techreport{aa19454fc178417a9332a0ad85f38726,

title = "Problem Reduction in Set Partitioning Problems",

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 = "algorithm, problem reducing",

author = "{van Krieken}, M.G.C. and H.A. Fleuren and M.J.P. Peeters",

note = "Pagination: 21",

year = "2003",

language = "English",

volume = "2003-80",

series = "CentER Discussion Paper",

publisher = "Operations research",

type = "WorkingPaper",

institution = "Operations research",

}

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 -

Problem Reduction in Set Partitioning Problems

Abstract

Publication series

Keywords

Access to Document

Fingerprint

Cite this