A note on solving large p-median problems
From MaRDI portal
Publication:1060943
DOI10.1016/0377-2217(85)90040-2zbMath0569.90021OpenAlexW2067307840MaRDI QIDQ1060943
Publication date: 1985
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(85)90040-2
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Inventory, storage, reservoirs (90B05)
Related Items
A heuristic for large-size \(p\)-median location problems with application to school location, A revised variable neighborhood search for the discrete ordered median problem, Clustering with or without the approximation, Making a state-of-the-art heuristic faster with data mining, BEAMR: an exact and approximate model for the \(p\)-median problem, The Methods for Approximation of Principal Points for Binary Distributions on the Basis of Submodularity, Variable neighborhood search for the pharmacy duty scheduling problem, Local search heuristics for the mobile facility location problem, A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation, The \(p\)-median problem: a survey of metaheuristic approaches, Computational study of large-scale \(p\)-median problems, Location and layout planning. A survey, Solving the \(p\)-median problem on regular and lattice networks, A Lagrangian search method for the \(P\)-median problem, Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem, A Branch Decomposition Algorithm for the p-Median Problem, Bee colony optimization for the \(p\)-center problem, Complexity evaluation of benchmark instances for the \(p\)-median problem, A method for solving to optimality uncapacitated location problems, The incremental cooperative design of preventive healthcare networks, The Location of Public Schools: Evaluation of Practical Experiences, New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems, J-means and I-means for minimum sum-of-squares clustering on networks, A fast swap-based local search procedure for location problems, Variable neighborhood search: Principles and applications, A family of facets for the uncapacitated \(p\)-median polytope, An exact algorithm for the capacitated vertex \(p\)-center problem, Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem, Solving thep-Center problem with Tabu Search and Variable Neighborhood Search, Lagrangean heuristics for location problems, A hybrid data mining metaheuristic for the p‐median problem, Dominant, an algorithm for the \(p\)-center problem., A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks, OR-Library, A computational evaluation of a general branch-and-price framework for capacitated network location problems, The \(p\)-median problem in fuzzy environment: proving fuzzy vertex optimality theorem and its application, On cutting planes for cardinality-constrained linear programs, Stabilized column generation, Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases, A branch-and-price approach for the continuous multifacility monotone ordered median problem, Enhancements to two exact algorithms for solving the vertex \(P\)-center problem, Variable neighborhood search for minimum sum-of-squares clustering on networks, Heuristic procedures for solving the discrete ordered median problem
Uses Software
Cites Work
- A tree search algorithm for the p-median problem
- p-Medians and Multi-Medians
- Solving Large-Scale Zero-One Linear Programming Problems
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Validation of subgradient optimization
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
