Finding minimum label spanning trees using cross‐entropy method

DOI10.1002/NET.22057MaRDI QIDQ6065862zbMATH OpenOpenAlexFDO

Authors 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

communication network designcross-entropydata compressionevolutionary optimizationminimum label spanning tree

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• The minimum labeling spanning trees
• scientific article; zbMATH DE number 1098881
• On the minimum label spanning tree problem
• Multi-label learning through minimum spanning tree-based subset selection and feature extraction
• Solving the minimum labelling spanning tree problem using hybrid local search
• Solving the minimum label spanning tree problem by mathematical programming techniques
• Evaluation of classification performances of minimum spanning trees by 13 different metrics
• A note on the minimum label spanning tree.
• Minimum spanning tree classification algorithm based on the granular space
• scientific article; zbMATH DE number 1163859

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6065862)