Finding minimum label spanning trees using cross‐entropy method (Q6065862): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Stochastic simulation: Algorithms and analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing evolutionary algorithms to the (\(1+1\))-EA / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mixed integer linear formulation for the minimum label spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum labeling spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the minimum label spanning tree problem by mathematical programming techniques / 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 neighbourhood search for the minimum labelling Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the minimum labelling spanning tree problem using hybrid local search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to the generalized minimum labeling spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum spanning trees made easier via multi-objective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4720653 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of computer simulation models with rare events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cross-entropy and rare events for maximal cut and partition problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid metaheuristic for the minimum labeling spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / 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:10, 21 August 2024

scientific article; zbMATH DE number 7775507
Language Label Description Also known as
English
Finding minimum label spanning trees using cross‐entropy method
scientific article; zbMATH DE number 7775507

    Statements

    Finding minimum label spanning trees using cross‐entropy method (English)
    0 references
    0 references
    0 references
    11 December 2023
    0 references
    communication network design
    0 references
    cross-entropy
    0 references
    data compression
    0 references
    evolutionary optimization
    0 references
    minimum label spanning tree
    0 references

    Identifiers