Algorithms to solve the knapsack constrained maximum spanning tree problem (Q4663307): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 16:47, 5 March 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
    0 references
    0 references
    0 references
    30 March 2005
    0 references
    minimum spanning tree problem
    0 references
    Knapsack problem
    0 references
    combinatorial optimization
    0 references

    Identifiers