Dynamically second-preferred p-center problem

DOI10.1016/J.EJOR.2022.09.019MaRDI QIDQ6106963zbMATH OpenFDO

Authors Yolanda Hinojosa, Alfredo Marín, Justo Puerto

Publication date 3 July 2023

Published in European Journal of Operational Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://doi.org/10.1016/J.EJOR.2022.09.019

zbMATH Keywords

\(p\)-center\(p\)-next centerinteger programminglocation

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• When centers can fail: a close second opportunity
• Capacitated p-center problem with failure foresight
• The probabilistic \(p\)-center problem: planning service for potential customers
• The stratified p-center problem

Cites work

• A Canonical Representation of Simple Plant Location Problems and Its Applications
• A comparison of formulations and solution methods for the minimum-envy location problem
• A flexible model and efficient solution strategies for discrete location problems
• A new formulation and resolution method for the p-center problem
• A strengthened formulation for the simple plant location problem with order
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An exact algorithm for the capacitated vertex \(p\)-center problem
• An extended covering model for flexible discrete and equity location problems
• Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
• GRASP and VNS for solving the \(p\)-next center problem
• Heuristic Solution Methods for Two Location Problems with Unreliable Facilities
• Improving the quality of heuristic solutions for the capacitated vertex p-center problem through iterated greedy local search with variable neighborhood descent
• Lagrangean duals and exact solution to the capacitated \(p\)-center problem
• Large-scale local search heuristics for the capacitated vertexp-center problem
• Location science
• Mathematical models and search algorithms for the capacitated p-center problem
• Metaheuristic approaches to solving large-scale Bilevel Uncapacitated Facility Location Problem with clients' preferences
• Metaheuristic methods for solving the bilevel uncapacitated facility location problem with clients' preferences
• Mixed-integer formulations for the capacitated rank pricing problem with envy
• New facets for the two-stage uncapacitated facility location polytope
• New lower bounds for the facility location problem with clients' preferences
• Polyhedral study of simple plant location problem with order
• Reliability models for the uncapacitated facility location problem with user preferences
• Solving large p-median problems with a radius formulation
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
• The Capacitated K-Center Problem
• The rank pricing problem with ties
• The rank pricing problem: models and branch-and-cut algorithms
• The reliable \(p\)-median problem with at-facility service
• When centers can fail: a close second opportunity

Cited in

(1)

• A facility location problem for extracurricular workshop planning: bi-level model and metaheuristics

This page was built for publication: Dynamically second-preferred \(p\)-center problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6106963)