Finding minimum label spanning trees using cross‐entropy method

DOI10.1002/net.22057OpenAlexW3164348708MaRDI QIDQ6065862

Radislav Vaisman

Publication date: 11 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22057

zbMATH Keywords

data compressioncross-entropyevolutionary optimizationcommunication network designminimum label spanning tree

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Solving the minimum label spanning tree problem by mathematical programming techniques
• Minimum spanning trees made easier via multi-objective optimization
• A mixed integer linear formulation for the minimum label spanning tree problem
• Greedy randomized adaptive search and variable neighbourhood search for the minimum labelling spanning tree problem
• Optimization of computer simulation models with rare events
• The minimum labeling spanning trees
• A hybrid metaheuristic for the minimum labeling spanning tree problem
• Worst-case behavior of the MVCA heuristic for the minimum labeling spanning tree problem
• Variable neighbourhood search for the minimum labelling Steiner tree problem
• A polyhedral approach to the generalized minimum labeling spanning tree problem
• Comparing evolutionary algorithms to the (\(1+1\))-EA
• Stochastic simulation: Algorithms and analysis
• Solving the minimum labelling spanning tree problem using hybrid local search
• Cross-entropy and rare events for maximal cut and partition problems
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Finding minimum label spanning trees using cross‐entropy method