Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
From MaRDI portal
Publication:3026701
DOI10.1287/trsc.21.3.163zbMath0624.90026OpenAlexW2024833164MaRDI QIDQ3026701
V. V. S. Murty, Ravindra K. Ahuja
Publication date: 1987
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.21.3.163
Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)
Related Items
Models and algorithms for network reduction ⋮ Designing a road network for hazardous materials shipments ⋮ 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 ⋮ Minimax flow tree problems ⋮ Algorithms for the optimum communication spanning tree problem ⋮ Network design for time‐constrained delivery ⋮ The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
