Exact approaches for the minimum subgraph diameter problem
From MaRDI portal
Publication:2108148
DOI10.1016/J.COR.2022.106050OpenAlexW4307850734MaRDI QIDQ2108148FDOQ2108148
Authors: Arthur Pratti Dadalto, Fábio Luiz Usberti, Mário César San Felice 
Publication date: 19 December 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106050
Recommendations
- Solving diameter-constrained minimum spanning tree problems by constraint programming
- Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
- Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem
- The Steiner tree problem with delays: a compact formulation and reduction procedures
- Approximating the degree-bounded minimum diameter spanning tree problem
Cites Work
- Network flows. Theory, algorithms, and applications.
- General network design: a unified view of combined location and network design problems
- Title not available (Why is that?)
- Two algorithms for constructing a Delaunay triangulation
- The complexity of the network design problem
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner trees
- Optimum Communication Spanning Trees
- The non-approximability of bicriteria network design problems
- The complexity of designing a network with minimum diameter
- New benchmark instances for the capacitated vehicle routing problem
Cited In (4)
Uses Software
This page was built for publication: Exact approaches 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 Q2108148)
