Computational study of large-scale \(p\)-median problems
From MaRDI portal
Publication:868446
DOI10.1007/s10107-005-0700-6zbMath1275.90112OpenAlexW2061184451MaRDI QIDQ868446
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
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (44)
Irregular polyomino tiling via integer programming with application in phased array antenna design ⋮ Public service system design with fuzzy parameters of perceived utility ⋮ A cutting plane algorithm for the capacitated facility location problem ⋮ Local search heuristics for the mobile facility location problem ⋮ K-medoids inverse regression ⋮ Some heuristic methods for solving \(p\)-median problems with a coverage constraint ⋮ Discrete facility location in machine learning ⋮ Configuration‐based approach for topological problems in the design of wireless sensor networks ⋮ Benders decomposition and column-and-row generation for solving large-scale linear programs with column-dependent-rows ⋮ A Branch Decomposition Algorithm for the p-Median Problem ⋮ An efficient Benders decomposition for the \(p\)-median problem ⋮ Semi-Lagrangian relaxation applied to the uncapacitated facility location problem ⋮ Complexity evaluation of benchmark instances for the \(p\)-median problem ⋮ Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows ⋮ Convex fuzzy \(k\)-medoids clustering ⋮ Discrete self-organizing migration algorithm and p-location problems ⋮ Data aggregation for \(p\)-median problems ⋮ An exact column-generation approach for the lot-type design problem ⋮ The location-dispatching problem: polyhedral results and content delivery network design ⋮ 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 ⋮ On the \(p\)-median polytope of \(Y\)-free graphs ⋮ A computational study of a nonlinear minsum facility location problem ⋮ An aggregation heuristic for large scale p-median problem ⋮ Unnamed Item ⋮ Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems ⋮ A tighter formulation of the \(p\)-median problem ⋮ Finding all pure strategy Nash equilibria in a planar location game ⋮ Algorithms for the one-dimensional two-stage cutting stock problem ⋮ Semi-fair design of emergency service system with failing centers ⋮ An improved Lagrangian relaxation and dual ascent approach to facility location problems ⋮ Affinity propagation and uncapacitated facility location problems ⋮ Efficient incrementing heuristics for generalized \(p\)-location problems ⋮ A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks ⋮ Near-optimal large-scale k-medoids clustering ⋮ A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem ⋮ 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 ⋮ Scenario Reduction Techniques in Stochastic Programming ⋮ Exemplar-based clustering via simulated annealing ⋮ An Exact Algorithm for Blockmodeling of Two-Mode Network Data ⋮ Using decomposition to improve greedy solutions of the optimal diversity management problem ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem ⋮ Variable neighborhood search for minimum sum-of-squares clustering on networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A note on solving large p-median problems
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- A tree search algorithm for the p-median problem
- An efficient tabu search procedure for the \(p\)-median problem
- Stabilized column generation
- Geometric algorithms and combinatorial optimization.
- An exact algorithm for the maximum stable set problem
- Cluster analysis and mathematical programming
- The volume algorithm: Producing primal solutions with a subgradient method
- A statistical analysis of simulated annealing applied to the \(p\)-median problem
- A branch-and-price approach to \(p\)-median location problems
- Lagrangean heuristics for location problems
- A hybrid heuristic for the \(p\)-median problem
- Variable neighborhood decomposition search
- The parallel variable neighborhood search for the \(p\)-median problem
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- Cluster Analysis: An Application of Lagrangian Relaxation
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A Dual-Bounded Algorithm for the p-Median Problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Variable neighborhood search for the p-median
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Integer Programming and the Theory of Grouping
- The Optimal Diversity Management Problem
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Cluster Analysis and Mathematical Programming
- 10.1162/153244303765208403
- On the \(p\)-median polytope
This page was built for publication: Computational study of large-scale \(p\)-median problems
