Maximal covering tree problems

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199302)40:1<129::AID-NAV3220400109>3.0.CO;2-T" /><129::AID-NAV3220400109>3.0.CO;2-T 10.1002/1520-6750(199302)40:1<129::AID-NAV3220400109>3.0.CO;2-TzbMath0772.90076OpenAlexW2012194824MaRDI QIDQ4695786

Richard L. Church, John R. Current

Publication date: 29 June 1993

Full work available at URL: https://doi.org/10.1002/1520-6750(199302)40:1<129::aid-nav3220400109>3.0.co;2-t

zbMATH Keywords

bicriterion problemmaximal direct covering tree problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (2)

A review of extensive facility location in networks ⋮ Efficient solution methods for covering tree problems

Cites Work

• Multiobjective programming and planning

This page was built for publication: Maximal covering tree problems