Revisiting search methods for the bounded-diameter minimum spanning tree problem

DOI10.1051/RO/2025008MaRDI QIDQ6855032zbMATH OpenFDO

Authors Rogério M. Nepomuceno, Rodrigo Lamblet Mafort, Fábio Protti, Isabel Rosseti, L. Simonetti, Edoarda Vallim

Publication date 23 February 2026

Published in RAIRO. Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2025008

zbMATH Keywords

bounded-diameter minimum spanning treeheuristicsiterated local search (ILS)spanning tree

Mathematics Subject Classification ID

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

Cites work

• A hybrid heuristic algorithm for the open-pit-mining operational planning problem
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
• An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion
• Dual heuristics on the exact solution of large Steiner problems
• Greedy heuristics for the bounded diameter minimum spanning tree problem
• Handbook of metaheuristics
• scientific article; zbMATH DE number 4010182 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 731844 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
• Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
• New Heuristic Approaches for the Bounded-Diameter Minimum Spanning Tree Problem
• Random-tree Diameter and the Diameter-constrained MST
• Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem
• Variable neighborhood search
• Variable neighborhood search: Principles and applications

This page was built for publication: Revisiting search methods for the bounded-diameter minimum spanning tree problem

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