Maximal covering tree problems
Data up to Jan 2025
Total Citations Per Year
Abstract
References (18)
On the shortest spanning subtree of a graph and the traveling salesman problem
1956 • 4,806 citations
Shortest Connection Networks And Some Generalizations
1957 • 4,371 citations
Multiobjective Programming and Planning
1978 • 2,045 citations
THE MAXIMAL COVERING LOCATION PROBLEM
1974 • 1,824 citations
The maximal covering location problem
1974 • 1,722 citations
Linear, Integer, and Quadratic Programming with LINDO
1985 • 297 citations
The Covering Salesman Problem
1989 • 230 citations
OPTIMAL LOCATION UNDER TIME OR DISTANCE CONSTRAINTS
1972 • 169 citations
The maximum covering/shortest path problem: A multiobjective network design and routing formulation
1985 • 142 citations
Generating multiobjective trade‐offs: An algorithm for bicriterion problems
1979 • 139 citations
Multiobjective design of transportation networks: Taxonomy and annotation
1986 • 128 citations
Location Modeling Utilizing Maximum Service Distance Criteria
1979 • 124 citations
Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
1987 • 32 citations
Maximal Direct Covering Tree Problems
1989 • 31 citations
An Application of Facilities Location Theory to the Design of Forest Harvesting Areas
1977 • 30 citations
The location of central structures in trees
1988 • 15 citations
A minimum-length covering subtree of a tree
1990 • 14 citations
Construction of efficient tree networks: The pipeline problem
1973 • 9 citations