Solving Large p-Median Problems with a Radius Formulation
From MaRDI portal
Publication:2899146
DOI10.1287/ijoc.1100.0418zbMath1243.90091OpenAlexW2154989541MaRDI QIDQ2899146
Sergio García, Martine Labbé, Alfredo Marín
Publication date: 28 July 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1100.0418
Related Items (39)
Public service system design with fuzzy parameters of perceived utility ⋮ Scenario reduction for stochastic programs with conditional value-at-risk ⋮ A mixed integer linear model for clustering with variable selection ⋮ A quadtree-based allocation method for a class of large discrete Euclidean location problems ⋮ Solving the \(p\)-median problem on regular and lattice networks ⋮ A comparative study of different formulations for the capacitated discrete ordered median problem ⋮ Biologically inspired parent selection in genetic algorithms ⋮ Variable neighborhood search for metric dimension and minimal doubly resolving set problems ⋮ Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem ⋮ Solving large \(p\)-median problems by a multistage hybrid approach using demand points aggregation and variable neighbourhood search ⋮ Discrete facility location in machine learning ⋮ Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem ⋮ The exam location problem: mathematical formulations and variants ⋮ A fresh view on the discrete ordered median problem based on partial monotonicity ⋮ Facility location problems with user cooperation ⋮ Dynamically second-preferred \(p\)-center problem ⋮ A Branch Decomposition Algorithm for the p-Median Problem ⋮ An efficient Benders decomposition for the \(p\)-median problem ⋮ Formulations and valid inequalities for the capacitated dispersion problem ⋮ Convex fuzzy \(k\)-medoids clustering ⋮ The complete vertex \(p\)-center problem ⋮ Discrete self-organizing migration algorithm and p-location problems ⋮ Mathematical models for stable matching problems with ties and incomplete lists ⋮ Unnamed Item ⋮ Balancing the arrival times of users in a two-stage location problem ⋮ An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems ⋮ The stratified \(p\)-center problem ⋮ Multiobjective optimization for multimode transportation problems ⋮ Convex Approach with Sub-gradient Method to Robust Service System Design ⋮ Facility location with tree topology and radial distance constraints ⋮ Semi-fair design of emergency service system with failing centers ⋮ An Approximative Lexicographic Min-Max Approach to the Discrete Facility Location Problem ⋮ Clustering and portfolio selection problems: a unified framework ⋮ Efficient incrementing heuristics for generalized \(p\)-location problems ⋮ Near-optimal large-scale k-medoids clustering ⋮ Mathematical Models and Search Algorithms for the Capacitated p-Center Problem ⋮ A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering ⋮ An approximation algorithm for the facility location problem with lexicographic minimax objective ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem
Uses Software
This page was built for publication: Solving Large p-Median Problems with a Radius Formulation
