Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem
Data up to Jan 2025
Total Citations Per Year
Abstract
References (13)
Reducibility among Combinatorial Problems
1972 • 10,743 citations
Complexity of Computer Computations
1972 • 2,804 citations
Lagrangean relaxation for integer programming
1974 • 1,056 citations
Lagrangian Relaxation for Integer Programming
2009 • 996 citations
A Branch-Bound Algorithm for Plant Location
1966 • 422 citations
An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
1972 • 292 citations
The Set-Partitioning Problem: Set Covering with Equality Constraints
1969 • 178 citations
On the Set-Covering Problem
1972 • 161 citations
Algorithms for the Simple Plant-Location Problem with Some Side Conditions
1969 • 148 citations
ON FINDING INTEGER SOLUTIONS TO LINEAR PROGRAMS
1964 • 125 citations
Combinatorial Programming: Methods and Applications
1976 • 112 citations
Technical Note—Location Theory: A Selective Bibliography
1974 • 76 citations
On the Set-Covering Problem: II. An Algorithm for Set Partitioning
1975 • 74 citations