Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem

2 references·16 citing·38 second hop

FromToDepth

this work references cited by second hop

References

1966A Branch-Bound Algorithm for Plant Location423 cited
1972An Efficient Branch and Bound Algorithm for the Warehouse Location Problem291 cited

Cited by

1996The Plant Location Problem: New Models and Research Prospects197 cited
1989On the exact solution of large-scale simple plant location problems167 cited
1983Locational analysis147 cited
1994Exact Solution to a Location Problem with Stochastic Demands139 cited
1983State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure136 cited
1983Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem136 cited
1999A tabu search approach to the uncapacitated facility location problem130 cited
1992A Dual-Based Procedure for Stochastic Facility Location129 cited
1983Heuristics for the capacitated plant location model128 cited
1984A branch-and-bound algorithm for the multi-level uncapacitated facility location problem123 cited
1986Discrete stochastic location models121 cited
2010Intermodal logistics: The interplay of financial, operational and service issues120 cited
1989A method for solving to optimality uncapacitated location problems

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work

118 cited

2005A hybrid multistart heuristic for the uncapacitated facility location problem112 cited

1996A dual algorithm for the uncapacitated hub location problem104 cited

1985Location and Layout Planning93 cited