Algorithms to solve the knapsack constrained maximum spanning tree problem (Q4663307)
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: Algorithms to solve the knapsack constrained maximum spanning tree problem |
scientific article; zbMATH DE number 2150695
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms to solve the knapsack constrained maximum spanning tree problem |
scientific article; zbMATH DE number 2150695 |
Statements
Algorithms to solve the knapsack constrained maximum spanning tree problem (English)
0 references
30 March 2005
0 references
minimum spanning tree problem
0 references
Knapsack problem
0 references
combinatorial optimization
0 references
0.7690795660018921
0 references
0.7597008347511292
0 references
