Algorithms to solve the knapsack constrained maximum spanning tree problem (Q4663307): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The knapsack problem: A survey / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Heuristic and exact algorithms for the precedence-constrained knapsack problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Procedure for Computing the <i>K</i> Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem / rank | |||
Normal rank | |||
Latest revision as of 20:07, 7 June 2024
scientific article; zbMATH DE number 2150695
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
