SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
A facility location problem with clients' preference orderings
8 references·16 citing·36 second hop
A facility location problem with clients' preference orderings (1987)A facility location problem with clients'…The uncapacitated facility location problem (1990)The uncapacitated facility lo…A comparison of two dual-based procedures for solving the p-median problem (1985)A comparison of two dual-base…The simple plant location problem: Survey and synthesis (1983)The simple plant location pro…A Dual-Based Procedure for Uncapacitated Facility Location (1978)A Dual-Based Procedure for Un…The Optimal Nodal Location of Public Facilities With Price‐Sensitive Demand (1975)The Optimal Nodal Location of…An Efficient Branch and Bound Algorithm for the Warehouse Location Problem (1972)An Efficient Branch and Bound…The Location of Emergency Service Facilities (1971)The Location of Emergency Ser…Central Facilities Location under an Investment Constraint (1970)Central Facilities Location u…A bi-level capacitated P-median facility location problem with the most likely allocation solution (2019)A bi-level capacitated P-medi…Solving the p-median bilevel problem with order through a hybrid heuristic (2017)Solving the p-median bilevel …Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences (2017)Approximating solutions to a …A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints (2015)A decomposition approach to s…The maximin HAZMAT routing problem (2014)The maximin HAZMAT routing pr…Solving the Bilevel Facility Location Problem under Preferences by a Stackelberg‐Evolutionary Algorithm (2014)Solving the Bilevel Facility …Branch-and-bound algorithm for a competitive facility location problem (2013)Branch-and-bound algorithm fo…Closest assignment constraints in discrete location problems (2011)Closest assignment constraint…The branch and cut method for the facility location problem with client’s preferences (2010)The branch and cut method for…Constructs for Multilevel Closest Assignment in Location Modeling (2010)Constructs for Multilevel Clo…New lower bounds for the facility location problem with clients’ preferences (2009)New lower bounds for the faci…A GIS-Based Decision-Support Tool for Public Facility Planning (2002)A GIS-Based Decision-Support …A dynamic optimization model for school network planning (2000)A dynamic optimization model …Closest assignment constraints and location models: Properties and structure (1996)Closest assignment constraint…Chapter 7 Location on networks (1995)Chapter 7 Location on networksUncapacitated Plant Location Under Alternative Spatial Price Policies (1990)Uncapacitated Plant Location …Central Facilities Location (1970)On Covering Problems and the Central Facilities Location Problem (1974)A Consumer Preference Approach to the Planning of Rural Primary Health-Care Facilities (1976)Locating service facilities to reduce lost demand (2006)Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph (1964)Spatial Interaction Models:Formulations and Applications (1988)Hierarchical earthquake shelter planning in urban areas: A case for Shanghai in China (2017)The Demand for the Services of Non-Federal Governments (1972)Optimizing Access to Public Services: A Review of Problems, Models and Methods of Locating Central Facilities (1978)MARKET PENETRATION AND LOCATIONAL CONFLICT IN FRANCHISE SYSTEMS* (1980)The p -Median Structure as a Unified Linear Model for Location—Allocation Analysis (1984)Cost-Benefit Analysis (2020)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)The design of reverse distribution networks: Models and solution procedures (2003)Multicommodity Distribution System Design by Benders Decomposition * † ‡ (2010)A Branch-Bound Algorithm for Plant Location (1966)A Heuristic Program for Locating Warehouses (1976)An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem (1977)Multiple Resource–Constrained Scheduling Using Branch and Bound (1978)A Dual-Based Procedure for Dynamic Facility Location (1982)The generalized maximal covering location problem (2002)The gradual covering decay location problem on a network (2003)Facility Location in Supply Chain Design (2005)A network location-allocation model trading off flow capturing andp-median objectives (1992)A statistical analysis of simulated annealing applied to the p-median problem (2000)A Survey of Solution Methods for the Continuous Location-Allocation Problem (2007)A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution (1983)Ambulance location and relocation models (2003)A dynamic logistics coordination model for evacuation and support in disaster response activities (2006)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)Incorporating location, inventory and price decisions into a supply chain distribution network design problem (2014)
this work references cited by second hop

References

  • 1971The Location of Emergency Service Facilities1,860 cited
  • 1978A Dual-Based Procedure for Uncapacitated Facility Location910 cited
  • 1983The simple plant location problem: Survey and synthesis544 cited
  • 1990The uncapacitated facility location problem484 cited
  • 1972An Efficient Branch and Bound Algorithm for the Warehouse Location Problem291 cited
  • 1975The Optimal Nodal Location of Public Facilities With Price‐Sensitive Demand117 cited
  • 1985A comparison of two dual-based procedures for solving the p-median problem111 cited
  • 1970Central Facilities Location under an Investment Constraint109 cited

Cited by

  • 1990Uncapacitated Plant Location Under Alternative Spatial Price Policies80 cited
  • 1996Closest assignment constraints and location models: Properties and structure70 cited
  • 2013Branch-and-bound algorithm for a competitive facility location problem70 cited
  • 2011Closest assignment constraints in discrete location problems68 cited
  • 2014The maximin HAZMAT routing problem62 cited
  • 2000A dynamic optimization model for school network planning60 cited
  • 2014Solving the Bilevel Facility Location Problem under Preferences by a Stackelberg‐Evolutionary Algorithm

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

54 cited
  • 1995Chapter 7 Location on networks53 cited
  • 2010The branch and cut method for the facility location problem with client’s preferences41 cited
  • 2009New lower bounds for the facility location problem with clients’ preferences40 cited
  • 2019A bi-level capacitated P-median facility location problem with the most likely allocation solution37 cited
  • 2017Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences35 cited
  • 2015A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints34 cited
  • 2010Constructs for Multilevel Closest Assignment in Location Modeling32 cited
  • 2002A GIS-Based Decision-Support Tool for Public Facility Planning32 cited
  • 2017Solving the p-median bilevel problem with order through a hybrid heuristic32 cited