On the complexity of the one-terminal network design problem
From MaRDI portal
Publication:1169929
DOI10.1016/0167-6377(82)90007-4zbMath0495.90036OpenAlexW2044456997MaRDI QIDQ1169929
Publication date: 1982
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(82)90007-4
computational complexityoptimal solutionminimum spanning treeNP-hardnessnetwork topologyconstruction costsone terminal network designproportional to distance travel costsusage costs
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10)
Cites Work