SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences
5 references·1 citing·24 second hop
Metaheuristic methods for solving the Bilevel Uncapacitated Facility Location Problem with Clients' Preferences (2012)Metaheuristic methods for solving the Bil…An Efficient Genetic Algorithm for Solving the Multi-Level Uncapacitated Facility Location Problem (2012)An Efficient Genetic Algorith…The branch and cut method for the facility location problem with client’s preferences (2010)The branch and cut method for…New lower bounds for the facility location problem with clients’ preferences (2009)New lower bounds for the faci…A strengthened formulation for the simple plant location problem with order (2006)A strengthened formulation fo…A facility location problem with clients' preference orderings (1987)A facility location problem w…A bi-level maximal covering location problem (2017)A bi-level maximal covering l…The Location of Emergency Service Facilities (1971)A Dual-Based Procedure for Uncapacitated Facility Location (1978)The simple plant location problem: Survey and synthesis (1983)Uncapacitated Plant Location Under Alternative Spatial Price Policies (1990)Closest assignment constraints and location models: Properties and structure (1996)Branch-and-bound algorithm for a competitive facility location problem (2013)Solving Airline Crew Scheduling Problems by Branch-and-Cut (1993)Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences (2017)GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering (2017)Solving the p-median bilevel problem with order through a hybrid heuristic (2017)Computationally Difficult Instances for the Uncapacitated Facility Location Problem (2005)A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints (2015)Central Facilities Location under an Investment Constraint (1970)The Optimal Nodal Location of Public Facilities With Price‐Sensitive Demand (1975)On the Uncapacitated Location Problem (1977)A flexible model and efficient solution strategies for discrete location problems (2009)Closest assignment constraints in discrete location problems (2011)The maximin HAZMAT routing problem (2014)Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph (1964)THE MAXIMAL COVERING LOCATION PROBLEM (1974)Covering problems in facility location: A review (2011)Exactly solving a two‐level location problem with modular node capacities (2011)A novel metaheuristic approach for collaborative learning group formation (2018)Vertiport Infrastructure Location Optimization for Equitable Access to Urban Air Mobility (2024)
this work references cited by second hop

References

  • 2006A strengthened formulation for the simple plant location problem with order83 cited
  • 1987A facility location problem with clients' preference orderings80 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
  • 2012An Efficient Genetic Algorithm for Solving the Multi-Level Uncapacitated Facility Location Problem35 cited

Cited by

  • 2017A bi-level maximal covering location problem24 cited

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