Solving large set covering problems on a personal computer (Q1097839)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Solving large set covering problems on a personal computer |
scientific article; zbMATH DE number 4035576
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving large set covering problems on a personal computer |
scientific article; zbMATH DE number 4035576 |
Statements
Solving large set covering problems on a personal computer (English)
0 references
1988
0 references
The set covering problem (SCP) was one of the first problems shown to be NP-complete. Heuristics are commonly used on mainframe computers in order to efficiently solve large-scale SCPs. In this paper, we use a new heuristic and several existing heuristics written in FORTRAN to solve 31 large (up to 2000 variables) SCPs on an IBM PC/AT. The new heuristic, SCAMP (set covering algorithm for the microprocessor), performed the best, with solution values deviating only in average 1,8 \% from the optimum.
0 references
set covering
0 references
NP-complete
0 references
heuristic
0 references
0 references
