A tree search approach for the solution of set problems using alternative relaxations

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	El-Darzi, E	-
dc.contributor.author	Mitra, G	-
dc.coverage.spatial	36	en
dc.date.accessioned	2008-06-03T12:51:21Z	-
dc.date.available	2008-06-03T12:51:21Z	-
dc.date.issued	1988	-
dc.identifier.citation	Maths Technical Papers (Brunel University). July 1988, pp 1-30	en
dc.identifier.uri	http://bura.brunel.ac.uk/handle/2438/2341	-
dc.description.abstract	A number of alternative relaxations for the family of set problems (FSP) in general and set covering problems (SCP) in particular are introduced and discussed. These are (i) Network flow relaxation, (ii) Assignment relaxation, (iii) Shortest route relaxation, (iv) Minimum spanning tree relaxation. A unified tree search method is developed which makes use of these relaxations. Computational experience of processing a collection of test problems is reported.	en
dc.format.extent	291402 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\03\88	-
dc.subject	integer programming	en
dc.subject	discrete optimisation	en
dc.subject	set covering	en
dc.subject	scheduling	en
dc.subject	assignment	en
dc.title	A tree search approach for the solution of set problems using alternative relaxations	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_03_88.pdf		284.57 kB	Adobe PDF	View/Open