Please use this identifier to cite or link to this item:
|Title:||A tree search approach for the solution of set problems using alternative relaxations|
|Keywords:||integer programming;discrete optimisation;set covering;scheduling;assignment|
|Citation:||Maths Technical Papers (Brunel University). July 1988, pp 1-30|
|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.|
|Appears in Collections:||Dept of Mathematics Research Papers|
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.