A New Formulation and Resolution Method for the p-Center Problem
From MaRDI portal
Publication:2890410
DOI10.1287/ijoc.1030.0028zbMath1239.90103OpenAlexW1981991106MaRDI QIDQ2890410
Yves Pochet, Sourour Elloumi, Martine Labbé
Publication date: 8 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1030.0028
Related Items (50)
Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem ⋮ The mixed center location problem ⋮ A scalable exact algorithm for the vertex \(p\)-center problem ⋮ A revised variable neighborhood search for the discrete ordered median problem ⋮ Capacitated \(p\)-center problem with failure foresight ⋮ Location of Emergency Facilities with Uncertainty in the Demands ⋮ Double bound method for solving the \(p\)-center location problem ⋮ 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 comparative study of different formulations for the capacitated discrete ordered median problem ⋮ The ordered capacitated facility location problem ⋮ A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem ⋮ Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem ⋮ Facility location problems on graphs with non-convex neighborhoods ⋮ A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem ⋮ A fresh view on the discrete ordered median problem based on partial monotonicity ⋮ Dynamically second-preferred \(p\)-center problem ⋮ Territorial design for customers with demand frequency ⋮ A robust \(p\)-center problem under pressure to locate shelters in wildfire context ⋮ Formulations and valid inequalities for the capacitated dispersion problem ⋮ Exact solution approaches for the discrete α‐neighbor p‐center problem ⋮ Optimization problems with flexible objectives: a general modeling approach and applications ⋮ Alternative formulations for the obnoxious \(p\)-median problem ⋮ The complete vertex \(p\)-center problem ⋮ Exact approaches for solving a covering problem with capacitated subtrees ⋮ GRASP and VNS for solving the \(p\)-next center problem ⋮ Solving haplotyping inference parsimony problem using a new basic polynomial formulation ⋮ An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation ⋮ Discrete self-organizing migration algorithm and p-location problems ⋮ Unnamed Item ⋮ A new compact formulation for the discrete \(p\)-dispersion problem ⋮ Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane ⋮ New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems ⋮ The stratified \(p\)-center problem ⋮ A dual bounding scheme for a territory design problem ⋮ Single-allocation ordered median hub location problems ⋮ A combined facility location and network design problem with multi-type of capacitated links ⋮ A multi-objective integrated facility location-hardening model: analyzing the pre- and post-disruption tradeoff ⋮ Data Exploration by Representative Region Selection: Axioms and Convergence ⋮ Mathematical Models and Search Algorithms for the Capacitated p-Center Problem ⋮ A flexible model and efficient solution strategies for discrete location problems ⋮ Less is more approach in optimization: a road to artificial intelligence ⋮ Distribution systems design with role dependent objectives ⋮ Improving fairness in ambulance planning by time sharing ⋮ Lagrangean duals and exact solution to the capacitated \(p\)-center problem ⋮ Discrete Center Problems ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem ⋮ Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants ⋮ Enhancements to two exact algorithms for solving the vertex \(P\)-center problem ⋮ Heuristic procedures for solving the discrete ordered median problem
Uses Software
This page was built for publication: A New Formulation and Resolution Method for the p-Center Problem
