A polyhedral study of the diameter constrained minimum spanning tree problem

DOI10.1016/j.dam.2020.05.020zbMath1450.90013OpenAlexW3036355315MaRDI QIDQ2197445

Markus Leitner, Ivana Ljubić, Luís Gouveia

Publication date: 31 August 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://research.vu.nl/en/publications/0fd99c6e-e540-48bd-af1a-80e0d16c2087

zbMATH Keywords

integer programmingfacetdiameter constrained trees

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Integer programming (90C10)

Related Items (2)

A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints ⋮ Bilinear matrix equation characterizes Laplacian and distance matrices of weighted trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \(k\) edge-disjoint 3-hop-constrained paths polytope
• A complete characterization of jump inequalities for the hop-constrained shortest path problem
• An analytical comparison of different formulations of the travelling salesman problem
• On the directed hop-constrained shortest path problem
• Notes on polyhedra associated with hop-constrained paths
• On the \(k\) edge-disjoint 2-hop-constrained paths polytope
• The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
• Using a Hop-Constrained Model to Generate Alternative Communication Network Design
• Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
• A catalog of steiner tree formulations
• Solution of a Large-Scale Traveling-Salesman Problem
• Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs

This page was built for publication: A polyhedral study of the diameter constrained minimum spanning tree problem