Variable neighborhood search for the heaviest \(k\)-subgraph (Q1025229)
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: Variable neighborhood search for the heaviest \(k\)-subgraph |
scientific article; zbMATH DE number 5566380
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Variable neighborhood search for the heaviest \(k\)-subgraph |
scientific article; zbMATH DE number 5566380 |
Statements
Variable neighborhood search for the heaviest \(k\)-subgraph (English)
0 references
18 June 2009
0 references
combinatorial optimization
0 references
heaviest \(k\)-subgraph
0 references
maximum diversity
0 references
metaheuristics
0 references
variable neighborhood search
0 references
