Brunel University Research Archive(BURA) preserves and enables easy and open access to all
types of digital content. It showcases Brunel's research outputs.
Research contained within BURA is open access, although some publications may be subject
to publisher imposed embargoes. All awarded PhD theses are also archived on BURA.
Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/2594| Title: | Set covering and set partitioning: a collection of test problems |
| Authors: | El-Darzi, E Mitra, G |
| Issue Date: | 1988 |
| Publisher: | Brunel University |
| Citation: | Maths Technical Papers (Brunel University). June 1988, pp 1-20 |
| Series/Report no.: | ;TR\01\88 |
| 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. |
| URI: | http://bura.brunel.ac.uk/handle/2438/2594 |
| Appears in Collections: | Dept of Mathematics Research Papers Mathematical Sciences |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| TR_01_89.pdf | 339.34 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.