Back to search
On the Uncapacitated Location Problem
Data up to Jan 2025
Published1977
Citations140
References9
Total Citations Per Year
Abstract
References (9)
Approximation algorithms for combinatorial problems
1974 • 2,224 citations
The Traveling-Salesman Problem and Minimum Spanning Trees
1970 • 1,431 citations
Lagrangean relaxation for integer programming
1974 • 1,056 citations
The traveling-salesman problem and minimum spanning trees: Part II
1971 • 1,010 citations
Lagrangian Relaxation for Integer Programming
2009 • 996 citations
On the Computational Complexity of Combinatorial Problems
1975 • 683 citations
Algorithms for the Simple Plant-Location Problem with Some Side Conditions
1969 • 148 citations
Technical Note—Location Theory: A Selective Bibliography
1974 • 76 citations
A New Algorithm for Computing Correlations
1974 • 15 citations
Cited By (0)
Loading...