A hybrid of max-min ant system and linear programming for the \(k\)-covering problem (Q342539)
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: A hybrid of max-min ant system and linear programming for the \(k\)-covering problem |
scientific article; zbMATH DE number 6654237
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid of max-min ant system and linear programming for the \(k\)-covering problem |
scientific article; zbMATH DE number 6654237 |
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
