The class Steiner minimal tree problem: A lower bound and test problem generation

DOI10.1007/s002360000042zbMath0962.68176OpenAlexW1984586534MaRDI QIDQ1591047

Paul Gillard, Boting Yang

Publication date: 3 January 2001

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002360000042

zbMATH Keywords

very large scale integrationSteiner minimal tree problem

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10)

Related Items

The prize collecting Steiner tree problem: models and Lagrangian dual optimization approaches, The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm, Some formulations for the group Steiner tree problem, Generalized network design problems., The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm, Unnamed Item