Indirect covering tree problems on spanning tree networks
From MaRDI portal
Publication:2368291
DOI10.1016/0377-2217(93)90141-9zbMath0772.90056MaRDI QIDQ2368291
Charles S. Re Velle, Vicki Aaronson Hutson
Publication date: 24 August 1993
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)90141-9
spanning tree; facility location; tree algorithms; backbone network; indirect covering tree; minimum cost covering subtree
90C35: Programming involving graphs or networks
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
90B80: Discrete location and assignment
Related Items
A review of extensive facility location in networks, Efficient solution methods for covering tree problems, Multiobjective transportation network design and routing problems: Taxonomy and annotation
Cites Work