Please use this identifier to cite or link to this item:
|Title:||Set covering and set partitioning: a collection of test problems|
|Citation:||Maths Technical Papers (Brunel University). June 1988, pp 1-20|
|Abstract:||It is now well established that set covering and set partitioning models play a central role in many scheduling applications. There are many algorithms which solve these problems. In order to test and validate such implementations we have collected a range of test problems taken from different contexts. A brief description of these models, their applications and summary model data, are supplied in this paper.|
|Appears in Collections:||Dept of Mathematics Research Papers|
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.