New branch-and-bound algorithms for \(k\)-cardinality tree problems (Q2840678)
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: New branch-and-bound algorithms for \(k\)-cardinality tree problems |
scientific article; zbMATH DE number 6190214
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New branch-and-bound algorithms for \(k\)-cardinality tree problems |
scientific article; zbMATH DE number 6190214 |
Statements
23 July 2013
0 references
\(k\)-cardinality tree problem
0 references
branch and bound method
0 references
combinatorial optimization
0 references
0 references
0.9350114
0 references
0.9059758
0 references
0 references
0.89524835
0 references
0.8859097
0 references
0.8840358
0 references
0.8821074
0 references
0.88134307
0 references
0.8812595
0 references
New branch-and-bound algorithms for \(k\)-cardinality tree problems (English)
0 references
