An efficient heuristic for large set covering problems (Q3318543): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/nav.3800310118 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2023444198 / 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 | |||
Latest revision as of 11:14, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient heuristic for large set covering problems |
scientific article |
Statements
An efficient heuristic for large set covering problems (English)
0 references
1984
0 references
combinatorial optimization
0 references
random test problems
0 references
computational experience
0 references
comparison of algorithms
0 references
heuristic algorithm
0 references
large set covering problems
0 references
random selection rule
0 references
