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

A novel approach is proposed for the NP-hard min-degree constrained minimum spanning tree (md-MST). The NP-hardness of the md-MST demands that heuristic approximations are used to tackle its intractability and thus an original genetic algorithm strategy is described using an improvement of the Marti...

Full description

Bibliographic Details
Main Author: Salgueiro, R. (author)
Other Authors: de Almeida, A. (author), Oliveira, O. (author)
Format: article
Language:eng
Published: 2017
Subjects:
Combinatorial optimization
Degree-constrained spanning tree
Genetic algorithm
Heuristic
Lower bound
Online Access:http://hdl.handle.net/10071/12779
Country:Portugal
Oai:oai:repositorio.iscte-iul.pt:10071/12779

Internet

http://hdl.handle.net/10071/12779

Similar Items