A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem (Q3625008)

From MaRDI portal
Revision as of 02:02, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem
scientific article

    Statements

    A Lagrangian Decomposition/Evolutionary Algorithm Hybrid for the Knapsack Constrained Maximum Spanning Tree Problem (English)
    0 references
    0 references
    0 references
    0 references
    7 May 2009
    0 references
    knapsack constrained maximum spanning tree
    0 references
    Lagrangian decomposition
    0 references
    evolutionary algorithm
    0 references
    hybrid approach
    0 references
    volume algorithm
    0 references
    local search
    0 references

    Identifiers