Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

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

A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes

7 references·4 citing·40 second hop

FromToDepth

this work references cited by second hop

References

1987Efficient algorithms for the capacitated concentrator location problem184 cited
2003A column generation approach to capacitated p-median problems183 cited
1977Modeling Facility Location Problems as Generalized Assignment Problems133 cited
2004Hybrid scatter search and path relinking for the capacitated p-median problem99 cited
2002A new method for solving capacitated location problems based on a set partitioning approach76 cited
2005A branch‐and‐price algorithm for the capacitated p‐median problem65 cited
2003Local Search Heuristics for Capacitated p-Median Problems59 cited

Cited by

2013A hybrid metaheuristic approach for the capacitated p-median problem42 cited
2021A matheuristic for large-scale capacitated clustering36 cited
2017An improved cut-and-solve algorithm for the single-source capacitated facility location problem34 cited
2018An effective hybrid approach to the two-stage capacitated facility location problem34 cited

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