New genetic algorithm approach for the MIN-degree constrained minimum spanning tree
From MaRDI portal
Publication:1751721
DOI10.1016/j.ejor.2016.11.007zbMath1394.90497OpenAlexW2556941013MaRDI QIDQ1751721
Orlando Oliveira, Ana de Almeida, Rui Salgueiro
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
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem ⋮ A joint problem of strategic workforce planning and fleet renewal: with an application in defense
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- 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
- Variable neighborhood search for the degree-constrained minimum spanning tree problem
- Evolution strategies. A comprehensive introduction
- Dioïds and semirings: Links to fuzzy sets and other applications
- md-MST is NP-hard for
- Min-degree constrained minimum spanning tree problem: complexity, properties, and formulations
- Comparison of algorithms for the degree constrained minimum spanning tree
This page was built for publication: New genetic algorithm approach for the MIN-degree constrained minimum spanning tree