Efficient solution methods for covering tree problems

DOI10.1007/BF02564788zbMath0916.90175MaRDI QIDQ1284598

T. Brian Boffey

Publication date: 26 April 1999

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

NP-hardlocationmaximal direct and indirect covering tree problems

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (1)

Extensive facility location problems on networks: an updated review

Cites Work

• Unnamed Item
• A minimum length covering subgraph of a network
• The hierarchical network design problem
• The location of central structures in trees
• Multiobjective programming and planning
• A review of extensive facility location in networks
• Indirect covering tree problems on spanning tree networks
• Maximal Direct Covering Tree Problems
• A minimum-length covering subtree of a tree
• Maximal covering tree problems

This page was built for publication: Efficient solution methods for covering tree problems