Maximal Direct Covering Tree Problems
From MaRDI portal
Publication:3474491
DOI10.1287/trsc.23.4.288zbMath0696.90073OpenAlexW2042997334MaRDI QIDQ3474491
Vicki Aaronson Hutson, Charles S. Re Velle
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
subtreemaximal direct covering tree problemnoninferior set estimation methodspanning tree networktwo-objective integer programming
Programming involving graphs or networks (90C35) Trees (05C05) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (8)
Multiobjective transportation network design and routing problems: Taxonomy and annotation ⋮ Indirect covering tree problems on spanning tree networks ⋮ Variable neighborhood tabu search and its application to the median cycle problem. ⋮ A Survey on Multiple Objective Minimum Spanning Tree Problems ⋮ 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
This page was built for publication: Maximal Direct Covering Tree Problems
