A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem

DOI10.1016/J.EJOR.2019.01.002zbMath1430.90553OpenAlexW2908606971WikidataQ128627715 ScholiaQ128627715MaRDI QIDQ1728477

Shyam Sundar, Kavita Singh

Publication date: 25 February 2019

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.01.002

zbMATH Keywords

combinatorial optimizationfast local searchmin-degree constrained spanning tree problemproblem-specific genetic operatorssteady-state genetic algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Degree-constrained \(k\)-minimum spanning tree problem ⋮ Novel biogeography-based optimization algorithm with hybrid migration and global-best Gaussian mutation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
• Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
• Tuning metaheuristics. A machine learning Perspective
• VNS and second order heuristics for the min-degree constrained minimum spanning tree problem
• Edge exchanges in the degree-constrained minimum spanning tree problem
• A genetic algorithm for the set covering problem
• A branch-and-cut algorithm for the minimum branch vertices spanning tree problem
• Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
• New genetic algorithm approach for the MIN-degree constrained minimum spanning tree
• Relations, models and a memetic approach for three degree-dependent spanning tree problems
• md-MST is NP-hard for
• A New Class of Algorithms for Multipoint Network Optimization

This page was built for publication: A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem