The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm

DOI10.1007/s00500-018-3557-3zbMath1418.90058OpenAlexW2897724698MaRDI QIDQ2317621

Adriano Masone, Claudio Sterle, M. Elena Nenni, Aantonio Sforza

Publication date: 12 August 2019

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-018-3557-3

zbMATH Keywords

shortest pathspanning treenetwork designrouting cost

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (1)

Special issue on: Optimization methods for decision making: advances and applications

Uses Software

• OR-Library

Cites Work

• A note on two problems in connexion with graphs
• Approximation algorithms for some optimum communication spanning tree problems
• On the minimum routing cost clustered tree problem
• A fast algorithm for computing minimum routing cost spanning trees
• Optimum Communication Spanning Trees
• Worst-Case Analysis of Network Design Problem Heuristics
• The complexity of the network design problem
• Exact algorithms for minimum routing cost trees
• A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
• A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees

This page was built for publication: The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm