Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem

DOI10.1287/TRSC.21.3.163MaRDI QIDQ3026701zbMATH OpenOpenAlexFDO

Authors Ravindra K. Ahuja, V. V. S. Murty

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

zbMATH Keywords

branch and boundheuristicNetwork designOptimum Communication Spanning Tree

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• Solving the optimum communication spanning tree problem
• Algorithms for the optimum communication spanning tree problem
• Combined column-and-row-generation for the optimal communication spanning tree problem
• Lagrangean bounds for the optimum communication spanning tree problem
• On Optimal Solutions for the Optimal Communication Spanning Tree Problem

Cited in

(16)

• Approximation algorithms for some optimum communication spanning tree problems
• Combined column-and-row-generation for the optimal communication spanning tree problem
• Solving the optimum communication spanning tree problem
• An exact approach for the minimum-cost bounded-error calibration tree problem
• The minimum flow cost Hamiltonian cycle problem: a comparison of formulations
• A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
• Algorithms for the optimum communication spanning tree problem
• Minimax flow tree problems
• Models and algorithms for network reduction
• An efficient branch and bound algorithm for the CMST problem
• Benders' partitioning approach for solving the optimal communication spanning tree problem
• New valid inequalities for the optimal communication spanning tree problem
• On Optimal Solutions for the Optimal Communication Spanning Tree Problem
• Network design for time‐constrained delivery
• Lagrangean bounds for the optimum communication spanning tree problem
• Designing a road network for hazardous materials shipments

This page was built for publication: Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3026701)