SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A tree search algorithm for the p-median problem
8 references·16 citing·32 second hop
A tree search algorithm for the p-median problem (1982)A tree search algorithm for the p-median …An Improved Algorithm for the Capacitated Facility Location Problem (1978)An Improved Algorithm for the…A Dual-Based Procedure for Uncapacitated Facility Location (1978)A Dual-Based Procedure for Un…Technical Note—An Algorithm for the p-Median Problem (1977)Technical Note—An Algorithm f…Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms (1977)Exceptional Paper—Location of…An Efficient Branch and Bound Algorithm for the Warehouse Location Problem (1972)An Efficient Branch and Bound…Algorithms for the Simple Plant-Location Problem with Some Side Conditions (1969)Algorithms for the Simple Pla…A Branch-Bound Algorithm for Plant Location (1966)A Branch-Bound Algorithm for …On the Location of Supply Points to Minimize Transport Costs (1964)On the Location of Supply Poi…Incorporating neighborhood reduction for the solution of the planar p-median problem (2015)Incorporating neighborhood re…Facility location design under continuous traffic equilibrium (2015)Facility location design unde…Initialization strategies to enhancing the performance of genetic algorithms for the p-median problem (2011)Initialization strategies to …A neural model for the p-median problem (2006)A neural model for the p-medi…A branch‐and‐price algorithm for the capacitated p‐median problem (2005)A branch‐and‐price algorithm …Uncapacitated facility location problems: contributions (2004)Uncapacitated facility locati…Hybrid scatter search and path relinking for the capacitated p-median problem (2004)Hybrid scatter search and pat…A branch-and-price approach to p-median location problems (2004)A branch-and-price approach t…Lagrangean/Surrogate Heuristics for p-Median Problems (2000)Lagrangean/Surrogate Heuristi…A statistical analysis of simulated annealing applied to the p-median problem (2000)A statistical analysis of sim…A Branch and Bound Algorithm for An Uncapacitated Facility Location Problem with a Side Constraint (1998)A Branch and Bound Algorithm …A dynamic programming heuristic for the P-median problem (1997)A dynamic programming heurist…Chapter 7 Location on networks (1995)Chapter 7 Location on networksA method for solving to optimality uncapacitated location problems (1989)A method for solving to optim…A comparison of two dual-based procedures for solving the p-median problem (1985)A comparison of two dual-base…‘Multidimensional’ extensions and a nested dual approach for the m-median problem (1985)‘Multidimensional’ extensions…Central Facilities Location (1970)The Location of Emergency Service Facilities (1971)A network location-allocation model trading off flow capturing andp-median objectives (1992)A Survey of Solution Methods for the Continuous Location-Allocation Problem (2007)Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph (1964)Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem (1997)A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro (2002)A hybrid multistart heuristic for the uncapacitated facility location problem (2005)An Analysis of Private and Public Sector Location Models (1970)A Heuristic Program for Locating Warehouses (1976)Facility location models for distribution planning (1985)Warehouse Location Under Continuous Economies of Scale (1966)Location‐Allocation Systems: A Review (1970)A Plant and Warehouse Location Problem (1977)On the Uncapacitated Location Problem (1977)An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem (1977)Heuristics for the capacitated plant location model (1983)A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem (2000)Multicommodity Distribution System Design by Benders Decomposition * † ‡ (2010)Data-driven distributionally robust capacitated facility location problem (2020)The simple plant location problem: Survey and synthesis (1983)An Overview of Representative Problems in Location Research (1989)The p-median problem: A survey of metaheuristic approaches (2006)Elimination of Source A and B Errors in p‐Median Location Problems (1987)Budget constrained location problem with opening and closing of facilities (2003)Nonpartisan Political Redistricting by Computer (1965)A Hybrid Heuristic for the p-Median Problem (2004)Multiple Resource–Constrained Scheduling Using Branch and Bound (1978)A Dual-Based Procedure for Dynamic Facility Location (1982)Network Design and Transportation Planning: Models and Algorithms (1984)Integer programming formulations of discrete hub location problems (1994)Location analysis: A synthesis and survey (2004)
this work references cited by second hop

References

  • 1978A Dual-Based Procedure for Uncapacitated Facility Location910 cited
  • 1977Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms794 cited
  • 1966A Branch-Bound Algorithm for Plant Location423 cited
  • 1964On the Location of Supply Points to Minimize Transport Costs347 cited
  • 1972An Efficient Branch and Bound Algorithm for the Warehouse Location Problem291 cited
  • 1977Technical Note—An Algorithm for the p-Median Problem149 cited
  • 1969Algorithms for the Simple Plant-Location Problem with Some Side Conditions146 cited
  • 1978An Improved Algorithm for the Capacitated Facility Location Problem129 cited

Cited by

  • 1989A method for solving to optimality uncapacitated location problems118 cited
  • 1985A comparison of two dual-based procedures for solving the p-median problem111 cited
  • 2004Hybrid scatter search and path relinking for the capacitated p-median problem99 cited
  • 2000A statistical analysis of simulated annealing applied to the p-median problem92 cited
  • 1985‘Multidimensional’ extensions and a nested dual approach for the m-median problem74 cited
  • 2000Lagrangean/Surrogate Heuristics for p-Median Problems69 cited

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

2005
A branch‐and‐price algorithm for the capacitated p‐median problem
65 cited
  • 2004A branch-and-price approach to p-median location problems63 cited
  • 1995Chapter 7 Location on networks53 cited
  • 2011Initialization strategies to enhancing the performance of genetic algorithms for the p-median problem47 cited
  • 2015Facility location design under continuous traffic equilibrium41 cited
  • 2006A neural model for the p-median problem41 cited
  • 1998A Branch and Bound Algorithm for An Uncapacitated Facility Location Problem with a Side Constraint39 cited
  • 2004Uncapacitated facility location problems: contributions38 cited
  • 1997A dynamic programming heuristic for the P-median problem38 cited
  • 2015Incorporating neighborhood reduction for the solution of the planar p-median problem34 cited