Algorithms to solve the knapsack constrained maximum spanning tree problem (Q4663307)

From MaRDI portal
Revision as of 18:17, 7 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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
    0 references
    0 references
    0 references
    30 March 2005
    0 references
    0 references
    minimum spanning tree problem
    0 references
    Knapsack problem
    0 references
    combinatorial optimization
    0 references