BEAMR: an exact and approximate model for the \(p\)-median problem

DOI10.1016/j.cor.2006.03.006zbMath1141.90463OpenAlexW2030994722MaRDI QIDQ2384887

Richard L. Church

Publication date: 10 October 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2006.03.006

zbMATH Keywords

integer programming\(p\)-medianvariable reductionapproximation approach

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Discrete location and assignment (90B80)

Related Items (11)

A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm ⋮ A two-level location-allocation problem in designing local access fiber optic networks ⋮ Solving the \(p\)-median problem on regular and lattice networks ⋮ Discrete facility location in machine learning ⋮ Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem ⋮ Optimization problems with flexible objectives: a general modeling approach and applications ⋮ The complete vertex \(p\)-center problem ⋮ An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation ⋮ Modeling \(s-t\) path availability to support disaster vulnerability assessment of network infrastructure ⋮ An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems ⋮ Concurrent optimization of harvesting and road network layouts under steep terrain

Uses Software

• OR-Library
• BEAMR

Cites Work

• A comparison of two dual-based procedures for solving the p-median problem
• A note on solving large p-median problems
• Facility siting and integer-friendly programming
• An efficient tabu search procedure for the \(p\)-median problem
• Heuristic concentration: Two stage solution construction
• COBRA: A new formulation of the classic \(p\)-median location problem
• Lagrangean heuristics for location problems
• The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
• A Dual-Based Procedure for Uncapacitated Facility Location
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Technical Note—An Algorithm for the p-Median Problem
• Variable neighborhood search for the p-median
• Integer Programming: Methods, Uses, Computations
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: BEAMR: an exact and approximate model for the \(p\)-median problem