Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
DOI10.1145/322358.322367zbMath0504.90052MaRDI QIDQ4740330
Publication date: 1983
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322358.322367
heuristics; approximate solutions; Dantzig-Wolfe decomposition; integer linear programming; optimal solution; network design; communication network; computational tests; tight lower bounds; capacited minimal directed tree problem; Lagrangean relaxation procedure
90C35: Programming involving graphs or networks
05C05: Trees
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C05: Linear programming
68R10: Graph theory (including graph drawing) in computer science
90B10: Deterministic network models in operations research
Related Items