Solving large set covering problems on a personal computer (Q1097839): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4142699 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Greedy Heuristic for the Set-Covering Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computer Solutions to Minimum-Cover Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient heuristic for large set covering problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Using a facility location algorithm to solve large set covering problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Hybrid heuristics for minimum cardinality set covering problems / rank | |||
Normal rank | |||
Latest revision as of 14:43, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving large set covering problems on a personal computer |
scientific article |
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
