A Dual-Bounded Algorithm for the p-Median Problem
From MaRDI portal
Publication:3898305
DOI10.1287/opre.28.5.1112zbMath0451.90040OpenAlexW2010385338MaRDI QIDQ3898305
Publication date: 1980
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.28.5.1112
computational resultsnetwork locationlinear programming relaxationdual linear programdual boundp-median problemmulti-facility location problembranch-andbound algorithmdual-bounded algorithm
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Inventory, storage, reservoirs (90B05)
Related Items (24)
A heuristic for large-size \(p\)-median location problems with application to school location ⋮ A neural model for the \(p\)-median problem ⋮ \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis ⋮ The \(p\)-median problem: a survey of metaheuristic approaches ⋮ Computational study of large-scale \(p\)-median problems ⋮ A Lagrangian search method for the \(P\)-median problem ⋮ A double annealing algorithm for discrete location/allocation problems ⋮ Developments in network location with mobile and congested facilities ⋮ A graph theoretical bound for the p-median problem ⋮ An efficient Benders decomposition for the \(p\)-median problem ⋮ A method for solving to optimality uncapacitated location problems ⋮ Locational analysis ⋮ A fast swap-based local search procedure for location problems ⋮ Affinity propagation and uncapacitated facility location problems ⋮ Lagrangean heuristics for location problems ⋮ A gamma heuristic for the \(p\)-median problem ⋮ An efficient tabu search procedure for the \(p\)-median problem ⋮ Exemplar-based clustering via simulated annealing ⋮ The simple plant location problem: Survey and synthesis ⋮ Network production-location problems under price uncertainty ⋮ Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems ⋮ A comparison of two dual-based procedures for solving the p-median problem ⋮ 'Multidimensional' extensions and a nested dual approach for the m-median problem ⋮ An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure
This page was built for publication: A Dual-Bounded Algorithm for the p-Median Problem
