Set covering and set partitioning: a collection of test problems

Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/2594

Full metadata record

DC Field	Value	Language
dc.contributor.author	El-Darzi, E	-
dc.contributor.author	Mitra, G	-
dc.coverage.spatial	26	en
dc.date.accessioned	2008-08-15T08:28:35Z	-
dc.date.available	2008-08-15T08:28:35Z	-
dc.date.issued	1988	-
dc.identifier.citation	Maths Technical Papers (Brunel University). June 1988, pp 1-20	en
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/2594	-
dc.description.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.	en
dc.format.extent	347484 bytes	-
dc.format.mimetype	application/pdf	-
dc.language.iso	en	-
dc.publisher	Brunel University	en
dc.relation.ispartof	Brunel University Mathematics Technical Papers collection;	-
dc.relation.ispartofseries	;TR\01\88	-
dc.title	Set covering and set partitioning: a collection of test problems	en
dc.type	Research Paper	en
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