Location problems
Data up to Jan 2025
Total Citations Per Year
Abstract
References (24)
Facility Layout and Location: An Analytical Approach
1991 • 1,097 citations
A Best Possible Heuristic for the k-Center Problem
1985 • 918 citations
Graph Theory: An Algorithmic Approach
1976 • 757 citations
Optimal packing and covering in the plane are NP-complete
1981 • 691 citations
Solving Large-Scale Zero-One Linear Programming Problems
1983 • 675 citations
On the Complexity of Some Common Geometric Location Problems
1984 • 660 citations
The simple plant location problem: Survey and synthesis
1983 • 541 citations
The uncapacitated facility location problem
1990 • 485 citations
State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
1983 • 333 citations
Domination, independent domination, and duality in strongly chordal graphs
1984 • 222 citations
Graph theory: An algorithmic approach (Computer science and applied mathematics)
1975 • 182 citations
A simple heuristic for the p-centre problem
1985 • 167 citations
Totally-Balanced and Greedy Matrices
1985 • 163 citations
Locational analysis
1983 • 141 citations
On the Uncapacitated Location Problem
1977 • 140 citations
State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
1983 • 139 citations
On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
1983 • 100 citations
The Computational Complexity of the m -Center Problems on the Plane
1981 • 97 citations
On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
1983 • 93 citations
Some facets of the simple plant location polytope
1982 • 89 citations
Solving covering problems and the uncapacitated plant location problem on trees
1983 • 78 citations
Fractional vertices, cuts and facets of the simple plant location problem
1980 • 56 citations
Solving Nonlinear Single-Facility Network Location Problems
1986 • 19 citations
TOTALLY-BALANCED AND GREEDY MATRICES
2003 • 9 citations