Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

Solving the Capacitated Multi-Facility Weber Problem by Simulated Annealing, Threshold Accepting and Genetic Algorithms

10 references·2 citing·31 second hop

FromToDepth

this work references cited by second hop

References

1991Facility Layout and Location: An Analytical Approach1,091 cited
1991Linear programming and network flows673 cited
1993THE WEBER PROBLEM: HISTORY AND PERSPECTIVES.215 cited
1972The Transportation-Location Problem210 cited
1993Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances86 cited
1988NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands76 cited
1980Technical Note—Location Theory, Dominance, and Convexity: Some Further Results75 cited
1992A squared-euclidean distance location-allocation problem58 cited
2002Global Optimization Procedures for the Capacitated Euclidean and lp Distance Multifacility Location-Allocation Problems45 cited
1994A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem37 cited

Cited by

2019The location-allocation problem of drone base stations26 cited
2018The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem23 cited

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