A hybrid of max-min ant system and linear programming for the \(k\)-covering problem (Q342539): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An indirect genetic algorithm for set covering problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast approximation algorithm for the multicovering problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Experiments with LAGRASP heuristic for set \(k\)-covering / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering / rank | |||
Normal rank | |||
Latest revision as of 23:03, 12 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid of max-min ant system and linear programming for the \(k\)-covering problem |
scientific article |
Statements
A hybrid of max-min ant system and linear programming for the \(k\)-covering problem (English)
0 references
17 November 2016
0 references
set k-covering problem
0 references
linear programming
0 references
MAX-MIN ant system
0 references
hybrid heuristics
0 references
metahueristics
0 references
local search
0 references
