A new formulation and resolution method for the p-center problem

Cited In (56)

GRASP and VNS for solving the \(p\)-next center problem
An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation
Data Exploration by Representative Region Selection: Axioms and Convergence
Alternative formulations for the obnoxious \(p\)-median problem
Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants
A scalable exact algorithm for the vertex \(p\)-center problem
The stratified \(p\)-center problem
A relaxation-based algorithm for solving the conditional \(p\)-center problem
Discrete self-organizing migration algorithm and p-location problems
A new compact formulation for the discrete \(p\)-dispersion problem
The complete vertex \(p\)-center problem
The mixed center location problem
Improving fairness in ambulance planning by time sharing
A revised variable neighborhood search for the discrete ordered median problem
Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
Location of Emergency Facilities with Uncertainty in the Demands
A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff
Mathematical Models and Search Algorithms for the Capacitated p-Center Problem
A combined facility location and network design problem with multi-type of capacitated links
A fresh view on the discrete ordered median problem based on partial monotonicity
Single-allocation ordered median hub location problems
The ordered capacitated facility location problem
Capacitated \(p\)-center problem with failure foresight
Un nuevo resultado sobre la complejidad del problema delP-centro
Double bound method for solving the \(p\)-center location problem
When centers can fail: a close second opportunity
A branch-and-price approach for the continuous multifacility monotone ordered median problem
A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem
Heuristic procedures for solving the discrete ordered median problem
Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent
Territorial design for customers with demand frequency
Distribution systems design with role dependent objectives
Lagrangean duals and exact solution to the capacitated \(p\)-center problem
Discrete Center Problems
Formulations and valid inequalities for the capacitated dispersion problem
A flexible model and efficient solution strategies for discrete location problems
Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
Solving haplotyping inference parsimony problem using a new basic polynomial formulation
A comparative study of different formulations for the capacitated discrete ordered median problem
New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
Optimization problems with flexible objectives: a general modeling approach and applications
Less is more approach in optimization: a road to artificial intelligence
On the Solution Value of the Continuous p-Center Location Problem on a Graph
A \(p\)-center grid-positioning aggregation procedure
Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
A robust \(p\)-center problem under pressure to locate shelters in wildfire context
Facility location problems on graphs with non-convex neighborhoods
A dual bounding scheme for a territory design problem
Exact approaches for solving a covering problem with capacitated subtrees
A new formulation for the conditional \(p\)-median and \(p\)-center problems
A constructive heuristic for the uniform capacitated vertex \(k\)-center problem
Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem
Exact solution approaches for the discrete α‐neighbor p‐center problem
A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem
Title not available (Why is that?)
Dynamically second-preferred \(p\)-center problem

Uses Software

TSPLIB
OR-Library

This page was built for publication: A new formulation and resolution method for the \(p\)-center problem

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