Biased random-key genetic algorithms for the minimum subgraph diameter problem

DOI10.1007/S11590-024-02177-YMaRDI QIDQ7289028zbMATH OpenFDO

Authors Arthur Pratti Dadalto, Fábio Luiz Usberti, Mário César San Felice

Publication date 2 July 2026

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11590-024-02177-Y

Mathematics Subject Classification ID

Graph theory (05Cxx) Discrete mathematics in relation to computer science (68Rxx) Mathematical programming (90Cxx)

Cites work

• Bicriteria network design problems
• Exact approaches for the minimum subgraph diameter problem
• Minimum diameter cost-constrained Steiner trees
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• The complexity of designing a network with minimum diameter

This page was built for publication: Biased random-key genetic algorithms for the minimum subgraph diameter problem

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