Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/2341
Title: A tree search approach for the solution of set problems using alternative relaxations
Authors: El-Darzi, E
Mitra, G
Keywords: integer programming;discrete optimisation;set covering;scheduling;assignment
Issue Date: 1988
Publisher: Brunel University
Citation: Maths Technical Papers (Brunel University). July 1988, pp 1-30
Series/Report no.: ;TR\03\88
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.
URI: http://bura.brunel.ac.uk/handle/2438/2341
Appears in Collections:Mathematical Science
Dept of Mathematics Research Papers

Files in This Item:
File Description SizeFormat 
TR_03_88.pdf284.57 kBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.