Solving the minimum labelling spanning tree problem using hybrid local search (Q2840755): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Local search for the minimum label spanning tree problem with bounded color classes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum labeling spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum label spanning tree problem / rank
 
Normal rank

Latest revision as of 15:28, 6 July 2024

scientific article
Language Label Description Also known as
English
Solving the minimum labelling spanning tree problem using hybrid local search
scientific article

    Statements

    Solving the minimum labelling spanning tree problem using hybrid local search (English)
    0 references
    23 July 2013
    0 references
    combinatorial optimization
    0 references
    graphs
    0 references
    networks
    0 references
    variable neighbourhood search
    0 references
    hybrid metaheuristics
    0 references
    minimum labelling spanning trees
    0 references

    Identifiers