Computational study of large-scale p-median problems
From MaRDI portal
Publication:868446
DOI10.1007/S10107-005-0700-6zbMATH Open1275.90112OpenAlexW2061184451MaRDI QIDQ868446FDOQ868446
Authors: Pasquale Avella, Antonio Sassano, Igor' Leonidovich Vasilyev 
Publication date: 5 March 2007
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-005-0700-6
Recommendations
- Solving large \(p\)-median problems with a radius formulation
- A note on solving large p-median problems
- A branch-and-price approach to \(p\)-median location problems
- The directional \(p\)-median problem: definition, complexity, and algorithms
- Two exact algorithms for the capacitated \(p\)-median problem
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Cites Work
- A note on solving large p-median problems
- An efficient tabu search procedure for the \(p\)-median problem
- Stabilized column generation
- Geometric algorithms and combinatorial optimization.
- Cluster analysis and mathematical programming
- Lagrangean heuristics for location problems
- A hybrid heuristic for the \(p\)-median problem
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- 10.1162/153244303765208403
- A statistical analysis of simulated annealing applied to the \(p\)-median problem
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Integer Programming and the Theory of Grouping
- Cluster Analysis and Mathematical Programming
- The volume algorithm: Producing primal solutions with a subgradient method
- Title not available (Why is that?)
- Variable neighborhood decomposition search
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Variable neighborhood search for the p-median
- The Optimal Diversity Management Problem
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- A branch-and-price approach to \(p\)-median location problems
- The parallel variable neighborhood search for the \(p\)-median problem
- Cluster Analysis: An Application of Lagrangian Relaxation
- A Dual-Bounded Algorithm for the p-Median Problem
- An exact algorithm for the maximum stable set problem
- On the \(p\)-median polytope
- A tree search algorithm for the p-median problem
- Title not available (Why is that?)
Cited In (56)
- Discrete facility location in machine learning
- Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- A branch-and-cut algorithm for the median-path problem
- Scenario Reduction Techniques in Stochastic Programming
- A computational study for the \(p\)-median problem
- Title not available (Why is that?)
- K-medoids inverse regression
- Finding all pure strategy Nash equilibria in a planar location game
- Irregular polyomino tiling via integer programming with application in phased array antenna design
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- Exemplar-based clustering via simulated annealing
- Algorithms for the one-dimensional two-stage cutting stock problem
- On the \(p\)-median polytope of \(Y\)-free graphs
- Public service system design with fuzzy parameters of perceived utility
- Affinity propagation and uncapacitated facility location problems
- A cutting plane algorithm for the capacitated facility location problem
- Large neighborhood search for the \(p\)-median problem
- Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows
- A branch-and-price approach for the continuous multifacility monotone ordered median problem
- A tighter formulation of the \(p\)-median problem
- Semi-fair design of emergency service system with failing centers
- Local search heuristics for the mobile facility location problem
- Discrete self-organizing migration algorithm and \(p\)-location problems
- An efficient Benders decomposition for the \(p\)-median problem
- Efficient incrementing heuristics for generalized \(p\)-location problems
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
- A Computational Study of the Pseudo-Boolean Approach to the p-Median Problem Applied to Cell Formation
- Using decomposition to improve greedy solutions of the optimal diversity management problem
- Near-optimal large-scale k-medoids clustering
- Complexity evaluation of benchmark instances for the \(p\)-median problem
- An Exact Algorithm for Blockmodeling of Two-Mode Network Data
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering
- A note on solving large p-median problems
- Data aggregation for \(p\)-median problems
- The location-dispatching problem: polyhedral results and content delivery network design
- Primal and dual bounds for the vertex \(p\)-median problem with balance constraints
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- Configuration‐based approach for topological problems in the design of wireless sensor networks
- Convex fuzzy \(k\)-medoids clustering
- A decomposition approach for the \(p\)-median problem on disconnected graphs
- A branch decomposition algorithm for the \(p\)-median problem
- Using dual feasible functions to construct fast lower bounds for routing and location problems
- Threshold robustness in discrete facility location problems: a bi-objective approach
- The decomposition method for the \(p\)-median problem on a disconnected graph
- An aggregation heuristic for large scale p-median problem
- Some heuristic methods for solving \(p\)-median problems with a coverage constraint
- A computational study of a nonlinear minsum facility location problem
- The location-dispatching problem: polyhedral results and content delivery network design
- The directional \(p\)-median problem: definition, complexity, and algorithms
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- An exact column-generation approach for the lot-type design problem
- Solving large \(p\)-median problems with a radius formulation
- Variable neighborhood search for minimum sum-of-squares clustering on networks
Uses Software
This page was built for publication: Computational study of large-scale \(p\)-median problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868446)
