A biased random-key genetic algorithm for the capacitated minimum spanning tree problem

Abstract

This paper focuses on the capacitated minimum spanning tree (CMST) problem. Given a central processor and a set of remote terminals with specified demands for traffic that must flow between the central processor and terminals, the goal is to design a minimum cost network to carry this demand. Potential links exist between any pair of terminals and between… (More)
DOI: 10.1016/j.cor.2014.11.011
View Slides

Topics

Statistics

02040201520162017
Citations per Year

Citation Velocity: 5

Averaging 5 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Cite this paper

@article{Ruiz2015ABR, title={A biased random-key genetic algorithm for the capacitated minimum spanning tree problem}, author={Efrain Ruiz and Maria Albareda-Sambola and Elena Fern{\'a}ndez and Mauricio G. C. Resende}, journal={Computers & OR}, year={2015}, volume={57}, pages={95-108} }