New genetic algorithm approach for the MIN-degree constrained minimum spanning tree

DOI10.1016/J.EJOR.2016.11.007MaRDI QIDQ1751721zbMATH OpenOpenAlexFDO

Authors Rui Salgueiro, Ana Maria de Almeida, Orlando Oliveira

Publication date 25 May 2018

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

Full work available at URL http://hdl.handle.net/10071/12779

zbMATH Keywords

combinatorial optimisationdegree-constrained spanning treegenetic algorithmheuristicLower bound

Mathematics Subject Classification ID

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

Recommendations

• A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem
• Comparison of algorithms for the degree constrained minimum spanning tree
• A note on genetic algorithms for degree-constrained spanning tree problems
• Constrained minimal spanning trees solved by a GA with feasible encodings
• An effective genetic algorithm approach to the quadratic minimum spanning tree problem

Cites work

• Comparison of algorithms for the degree constrained minimum spanning tree
• Dioïds and semirings: Links to fuzzy sets and other applications
• Evolution strategies. A comprehensive introduction
• scientific article; zbMATH DE number 610968 (Why is no real title available?)
• scientific article; zbMATH DE number 702365 (Why is no real title available?)
• scientific article; zbMATH DE number 1461432 (Why is no real title available?)
• Introduction to algorithms
• Introduction to probability and statistics for engineers and scientists
• md-MST is NP-hard for \(d\geq 3\)
• Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
• Min-degree constrained minimum spanning tree problem: new formulation via Miller-Tucker-Zemlin constraints
• On the shortest spanning subtree of a graph and the traveling salesman problem
• The min-degree constrained minimum spanning tree problem: formulations and branch-and-cut algorithm
• Tuning metaheuristics. A machine learning Perspective
• Variable neighborhood search for the degree-constrained minimum spanning tree problem
• VNS and second order heuristics for the min-degree constrained minimum spanning tree problem

Cited in

(11)

• An effective genetic algorithm approach to the quadratic minimum spanning tree problem
• A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem
• A genetic algorithm for minimum conflict weighted spanning tree problem
• A joint problem of strategic workforce planning and fleet renewal: with an application in defense
• Constrained minimal spanning trees solved by a GA with feasible encodings
• A learning automata-based algorithm to the stochastic min-degree constrained minimum spanning tree problem
• A note on genetic algorithms for degree-constrained spanning tree problems
• scientific article; zbMATH DE number 1990670 (Why is no real title available?)
• scientific article; zbMATH DE number 5204030 (Why is no real title available?)
• scientific article; zbMATH DE number 2214470 (Why is no real title available?)
• Comparison of algorithms for the degree constrained minimum spanning tree

Describes a project that uses

Uses Software

• Genocop

This page was built for publication: New genetic algorithm approach for the MIN-degree constrained minimum spanning tree

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