On Optimal Solutions for the Optimal Communication Spanning Tree Problem

DOI10.1287/opre.1080.0592zbMath1181.90060OpenAlexW2071380202WikidataQ58205463 ScholiaQ58205463MaRDI QIDQ5189006

Franz Rothlauf

Publication date: 6 March 2010

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f9cca73018a4d1d47e80f562f2b48e0577ef6252

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graphical methods in statistics (62A09)

Related Items (5)

Combined column-and-row-generation for the optimal communication spanning tree problem ⋮ Lagrangean bounds for the optimum communication spanning tree problem ⋮ New Valid Inequalities for the Optimal Communication Spanning Tree Problem ⋮ Solving the optimum communication spanning tree problem ⋮ The minimum flow cost Hamiltonian cycle problem: a comparison of formulations

This page was built for publication: On Optimal Solutions for the Optimal Communication Spanning Tree Problem