Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
Data up to Jan 2025
Total Citations Per Year
Abstract
References (15)
Discrete location theory
1991 • 1,305 citations
The simple plant location problem: Survey and synthesis
1983 • 541 citations
The uncapacitated facility location problem
1990 • 485 citations
Mathematical Programming: Structures and Algorithms
1981 • 294 citations
A Cross Decomposition Algorithm for Capacitated Facility Location
1986 • 267 citations
A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
1986 • 168 citations
Dynamic programming algorithms for the Zero-One Knapsack Problem
1980 • 146 citations
A heuristic lagrangean algorithm for the capacitated plant location problem
1984 • 144 citations
Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
1983 • 139 citations
On the choice of step size in subgradient optimization
1981 • 110 citations
A new Lagrangian relaxation approach to the generalized assignment problem
1986 • 107 citations
An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
1983 • 98 citations
A direct dual method for the mixed plant location problem with some side constraints
1979 • 92 citations
Mathematical Programming: Structures and Algorithms
1981 • 61 citations
A partial dual algorithm for the capacitated warehouse location problem
1986 • 14 citations