Maximal Direct Covering Tree Problems
From MaRDI portal
Publication:3474491
DOI10.1287/trsc.23.4.288zbMath0696.90073MaRDI QIDQ3474491
Charles S. Re Velle, Vicki Aaronson Hutson
Publication date: 1989
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.23.4.288
subtree; maximal direct covering tree problem; noninferior set estimation method; spanning tree network; two-objective integer programming
90C35: Programming involving graphs or networks
05C05: Trees
90C10: Integer programming
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem, A review of extensive facility location in networks, Efficient solution methods for covering tree problems, A unifying location model on tree graphs based on submodularity property, Variable neighborhood tabu search and its application to the median cycle problem., Multiobjective transportation network design and routing problems: Taxonomy and annotation, Indirect covering tree problems on spanning tree networks