Variable neighbourhood search for the minimum labelling Steiner tree problem (Q2267296): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5431855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5316723 / 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: Q3093335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Comparison of Alternative Tests of Significance for the Problem of $m$ Rankings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Computing Steiner Minimal Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable Neighborhood Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4704222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368539 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the minimum label spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Use of VNS and TS in classification: variable selection and determination of the linear discrimination function coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid VNS–path relinking for the p-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452897 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4319638 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4704239 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Looking ahead with the pilot method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the minimum label spanning tree. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in networks: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem / rank
 
Normal rank

Latest revision as of 11:40, 2 July 2024

scientific article
Language Label Description Also known as
English
Variable neighbourhood search for the minimum labelling Steiner tree problem
scientific article

    Statements

    Variable neighbourhood search for the minimum labelling Steiner tree problem (English)
    0 references
    0 references
    0 references
    0 references
    1 March 2010
    0 references
    graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers