A tree search algorithm for the p-median problem
From MaRDI portal
Publication:1162434
DOI10.1016/0377-2217(82)90160-6zbMath0481.90020OpenAlexW2010049267MaRDI QIDQ1162434
John E. Beasley, Nicos Christofides
Publication date: 1982
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(82)90160-6
lower boundscomparison of algorithmstree search algorithmp-median problemsubgradient optimisationheuristic upper boundmulti-facility location on networks
Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)
Related Items
A neural model for the \(p\)-median problem, Analysis of decomposition algorithms with Benders cuts for \(p\)-median problem, Computational study of large-scale \(p\)-median problems, On the exact solution of large-scale simple plant location problems, Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem, A method for solving to optimality uncapacitated location problems, Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem, Optimal partitioning of a data set based on the \(p\)-median model, Ant colony optimization for finding medians of weighted graphs, Online facility location with facility movements, A branch-and-price approach to \(p\)-median location problems, Facility location models for distribution system design, A family of facets for the uncapacitated \(p\)-median polytope, An improved Lagrangian relaxation and dual ascent approach to facility location problems, Affinity propagation and uncapacitated facility location problems, Lagrangean heuristics for location problems, A computational evaluation of a general branch-and-price framework for capacitated network location problems, A dynamic programming heuristic for the \(P\)-median problem, Exemplar-based clustering via simulated annealing, Clustering search algorithm for the capacitated centered clustering problem, On cutting planes for cardinality-constrained linear programs, Hybrid scatter search and path relinking for the capacitated \(p\)-median problem, Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems, A comparison of two dual-based procedures for solving the p-median problem, Algorithms for a multi-level network optimization problem, A note on solving large p-median problems, Analyzing tradeoffs between zonal constraints and accessibility in facility location, 'Multidimensional' extensions and a nested dual approach for the m-median problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- A Dual-Based Procedure for Uncapacitated Facility Location
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Technical Note—An Algorithm for the p-Median Problem
- A Branch and Bound Algorithm for the p-Median Transportation Problem
- An Improved Algorithm for the Capacitated Facility Location Problem
- Validation of subgradient optimization
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Algorithms for the Simple Plant-Location Problem with Some Side Conditions
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
