SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Fast bounding procedures for large instances of the Simple Plant Location Problem
16 references·1 citing·28 second hop
Fast bounding procedures for large instances of the Simple Plant Location Problem (2011)Fast bounding procedures for large instan…Solving the uncapacitated facility location problem using tabu search (2005)Solving the uncapacitated fac…Solving the simple plant location problem by genetic algorithm (2001)Solving the simple plant loca…Lagrangean heuristics for location problems (1993)Lagrangean heuristics for loc…Discrete location theory (1991)Discrete location theoryThe uncapacitated facility location problem (1990)The uncapacitated facility lo…On the exact solution of large-scale simple plant location problems (1989)On the exact solution of larg…An algorithm for solving large capacitated warehouse location problems (1988)An algorithm for solving larg…The simple plant location problem: Survey and synthesis (1983)The simple plant location pro…A Dual-Based Procedure for Dynamic Facility Location (1982)A Dual-Based Procedure for Dy…On the Extent to Which Certain Fixed-Charge Depot Location Problems can be Solved by LP (1978)On the Extent to Which Certai…A Dual-Based Procedure for Uncapacitated Facility Location (1978)A Dual-Based Procedure for Un…Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem (1977)Sharp Lower Bounds and Effici…A Heuristic Program for Locating Warehouses (1976)A Heuristic Program for Locat…Warehouse Location Under Continuous Economies of Scale (1966)Warehouse Location Under Cont…Plant Location Under Economies-of-Scale—Decentralization and Computation (1964)Plant Location Under Economie…A Heuristic Program for Locating Warehouses (1963)A Heuristic Program for Locat…An application of a Lagrangian-type relaxation for the uncapacitated facility location problem (2014)An application of a Lagrangia…A Branch-Bound Algorithm for Plant Location (1966)An Efficient Branch and Bound Algorithm for the Warehouse Location Problem (1972)Integer programming formulations of discrete hub location problems (1994)Location analysis: A synthesis and survey (2004)Management Models and Industrial Applications of Linear Programming (1957)Models of Man. (1959)Planning Production, Inventories, and Work Force. (1962)THE MAXIMAL COVERING LOCATION PROBLEM (1974)The design of robust value-creating supply chain networks: A critical review (2009)Cores of convex games (1971)An Overview of Representative Problems in Location Research (1989)Facility Layout and Location: An Analytical Approach (1991)PROCEEDINGS OF THE 1997 WINTER SIMULATION CONFERENCE (1997)Multicommodity Distribution System Design by Benders Decomposition * † ‡ (2010)Location-Allocation Problems (1963)Assignment Problems and the Location of Economic Activities (1957)Central Facilities Location (1970)Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms (1977)Network Design and Transportation Planning: Models and Algorithms (1984)Facility location under uncertainty: a review (2006)The generalized maximal covering location problem (2002)Strategic facility location: A review (1998)A characterisation of logistics networks for product recovery (2000)Facility location models for distribution system design (2004)The p-median problem: A survey of metaheuristic approaches (2006)Quantitative models for reverse logistics: A review (1997)Green supply‐chain management: A state‐of‐the‐art literature review (2007)Facility location and supply chain management – A review (2008)
this work references cited by second hop

References

  • 1991Discrete location theory1,291 cited
  • 1978A Dual-Based Procedure for Uncapacitated Facility Location910 cited
  • 1976A Heuristic Program for Locating Warehouses719 cited
  • 1963A Heuristic Program for Locating Warehouses650 cited
  • 1983The simple plant location problem: Survey and synthesis544 cited
  • 1990The uncapacitated facility location problem485 cited
  • 1993Lagrangean heuristics for location problems354 cited
  • 1966Warehouse Location Under Continuous Economies of Scale282 cited
  • 1982A Dual-Based Procedure for Dynamic Facility Location264 cited
  • 1977Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem226 cited
  • 1964Plant Location Under Economies-of-Scale—Decentralization and Computation212 cited
  • 2001Solving the simple plant location problem by genetic algorithm171 cited
  • 1989On the exact solution of large-scale simple plant location problems167 cited
  • 2005Solving the uncapacitated facility location problem using tabu search156 cited
  • 1988An algorithm for solving large capacitated warehouse location problems146 cited
  • 1978

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

On the Extent to Which Certain Fixed-Charge Depot Location Problems can be Solved by LP
79 cited

Cited by

  • 2014An application of a Lagrangian-type relaxation for the uncapacitated facility location problem14 cited