Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433)
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: Experiments with LAGRASP heuristic for set k-covering |
scientific article; zbMATH DE number 6111699
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Experiments with LAGRASP heuristic for set \(k\)-covering |
scientific article; zbMATH DE number 6111699 |
Statements
Experiments with LAGRASP heuristic for set \(k\)-covering (English)
0 references
30 November 2012
0 references
GRASP
0 references
hybrid heuristics
0 references
metaheuristics
0 references
path-relinking
0 references
Lagrangean relaxation
0 references
Lagrangean heuristics
0 references
local search
0 references
set covering
0 references
set multicovering
0 references
set \(k\)-covering
0 references
0 references
0 references
0.92253440618515
0 references
0.8267627358436584
0 references
0.8198536038398743
0 references
0.7959274649620056
0 references
