Common-Flow Formulations for the Diameter Constrained Spanning and Steiner Tree Problems
- 28 June 2024
- book chapter
- Published by Springer Nature
- p. 37-58
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Solving Steiner trees: Recent advances, challenges, and perspectivesNetworks, 2020
- The two-level diameter constrained spanning tree problemMathematical Programming, 2014
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphsMathematical Programming, 2009
- Improved heuristics for the bounded-diameter minimum spanning tree problemSoft Computing, 2006
- An intersecting tree model for odd-diameter-constrained minimum spanning and Steiner treesAnnals of Operations Research, 2006
- A 2-path approach for odd-diameter-constrained minimum spanning and Steiner treesNetworks, 2004
- Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs2004
- Network flow models for designing diameter‐constrained minimum‐spanning and Steiner treesNetworks, 2003
- The volume algorithm revisited: relation with bundle methodsMathematical Programming, 2002
- Computing a Diameter-Constrained Minimum Spanning Tree in ParallelLecture Notes in Computer Science, 2000