124,241 research outputs found
Recommended from our members
Set covering and set partitioning: a collection of test problems
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
Recommended from our members
A tree search approach for the solution of set problems using alternative relaxations
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
- β¦