Dynamically second-preferred \(p\)-center problem

Cites Work

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

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