SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Two exact algorithms for the capacitated p-median problem
5 references·1 citing·28 second hop
Two exact algorithms for the capacitated p-median problem (2003)Two exact algorithms for the capacitated …A new method for solving capacitated location problems based on a set partitioning approach (2002)A new method for solving capa…A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem (2002)A Branch-and-Price algorithm …Efficient algorithms for the capacitated concentrator location problem (1987)Efficient algorithms for the …A tree search algorithm for the p-median problem (1982)A tree search algorithm for t…Modeling Facility Location Problems as Generalized Assignment Problems (1977)Modeling Facility Location Pr…Methods for Solving the p-Median Problem: An Annotated Bibliography (2005)Methods for Solving the p-Med…Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph (1964)Discrete location theory (1991)Facility location : applications and theory (2001)An algorithm for solving large capacitated warehouse location problems (1988)An exact algorithm for the capacitated facility location problems with single sourcing (1999)A branch‐and‐price algorithm for the capacitated p‐median problem (2005)A cut-and-solve based algorithm for the single-source capacitated facility location problem (2012)On multi-criteria chance-constrained capacitated single-source discrete facility location problems (2018)A Branch-Bound Algorithm for Plant Location (1966)Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms (1977)A Dual-Based Procedure for Uncapacitated Facility Location (1978)A comparison of two dual-based procedures for solving the p-median problem (1985)A method for solving to optimality uncapacitated location problems (1989)Hybrid scatter search and path relinking for the capacitated p-median problem (2004)An Analysis of Network Location Problems with Distance Constraints (1984)A Cross Decomposition Algorithm for Capacitated Facility Location (1986)Improving harvesting and transport planning within a sugar value chain (2005)A Clustering‐Based Approach to the Capacitated Facility Location Problem1 (2008)A Heuristic Program for Locating Warehouses (1963)A Heuristic Program for Locating Warehouses (1976)The Maximal Covering Location Problem with Capacities on Total Workload (1991)Hub facility location with fixed costs (1992)An exact method for the two-echelon, single-source, capacitated facility location problem (2000)The Location of Emergency Service Facilities (1971)A multicriteria approach to the location of public facilities (1980)The p -Median Structure as a Unified Linear Model for Location—Allocation Analysis (1984)Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model (1986)Multicommodity Distribution System Design by Benders Decomposition * † ‡ (2010)
this work references cited by second hop

References

  • 1987Efficient algorithms for the capacitated concentrator location problem184 cited
  • 1977Modeling Facility Location Problems as Generalized Assignment Problems133 cited
  • 1982A tree search algorithm for the p-median problem117 cited
  • 2002A new method for solving capacitated location problems based on a set partitioning approach76 cited
  • 2002A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem67 cited

Cited by

  • 2005Methods for Solving the p-Median Problem: An Annotated Bibliography28 cited

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