SZodixStudyAcademic Library
ShelvesOpen access
Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated
New lower bounds for the facility location problem with clients’ preferences
3 references·4 citing·29 second hop
New lower bounds for the facility location problem with clients’ preferences (2009)New lower bounds for the facility locatio…A strengthened formulation for the simple plant location problem with order (2006)A strengthened formulation fo…Solving Airline Crew Scheduling Problems by Branch-and-Cut (1993)Solving Airline Crew Scheduli…A facility location problem with clients' preference orderings (1987)A facility location problem w…A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences (2020)A matheuristic for solving th…Solving the p-median bilevel problem with order through a hybrid heuristic (2017)Solving the p-median bilevel …GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering (2017)GRASP and hybrid GRASP-Tabu h…Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences (2017)Approximating solutions to a …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)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)THE MAXIMAL COVERING LOCATION PROBLEM (1974)On locating new facilities in a competitive environment (1983)Static competitive facility location: An overview of optimisation approaches (2001)Multi-objective two-echelon location-distribution of non-medical products (2020)Stability in Competition (1929)Stability in Competition (1990)A review of hierarchical facility location models (2005)A Multi-objective Cross Entropy-based algorithm for sustainable global food supply chain with risk considerations: A case study (2021)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)Network and Discrete Location: Models, Algorithms and Applications. (1997)Facility location models for distribution system design (2004)Location analysis: A synthesis and survey (2004)An Annotated Bibliography of Personnel Scheduling and Rostering (2004)Clearing algorithms for barter exchange markets (2007)An Anytime Algorithm for Optimal Coalition Structure Generation (2009)
this work references cited by second hop

References

  • 1993Solving Airline Crew Scheduling Problems by Branch-and-Cut537 cited
  • 2006A strengthened formulation for the simple plant location problem with order83 cited
  • 1987A facility location problem with clients' preference orderings80 cited

Cited by

  • 2017GRASP and hybrid GRASP-Tabu heuristics to solve a maximal covering location problem with customer preference ordering39 cited
  • 2017Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences35 cited
  • 2017Solving the p-median bilevel problem with order through a hybrid heuristic32 cited
  • 2020A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences29 cited

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