A comparison of two dual-based procedures for solving the p-median problem

DOI10.1016/0377-2217(85)90012-8zbMath0565.90011OpenAlexW2019777133MaRDI QIDQ1058960

Dominique Peeters, Pierre Hanjoul

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)90012-8

zbMATH Keywords

computational experiments\(p\)-median problemcomparison of algorithmsalternative Lagrangean relaxationsdual-based procedures

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)

Related Items

BEAMR: an exact and approximate model for the \(p\)-median problem, Cluster analysis and mathematical programming, A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation, An algorithm for minimizing clustering functions, Solving the anti-covering location problem using Lagrangian relaxation, On the exact solution of large-scale simple plant location problems, Fast modified global \(k\)-means algorithm for incremental cluster construction, A method for solving to optimality uncapacitated location problems, Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder), Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems, Optimal partitioning of a data set based on the \(p\)-median model, A network location-allocation model trading off flow capturing and \(p\)- median objectives, Facility location models for distribution system design, A heuristic algorithm for solving the minimum sum-of-squares clustering problems, An improved Lagrangian relaxation and dual ascent approach to facility location problems, Affinity propagation and uncapacitated facility location problems, Lagrangean heuristics for location problems, Heuristic solution of the multisource Weber problem as a \(p\)-median problem, A computational evaluation of a general branch-and-price framework for capacitated network location problems, Exemplar-based clustering via simulated annealing, Heuristics for Location Models, Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems, A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems, Analyzing tradeoffs between zonal constraints and accessibility in facility location, Integer programming formulations of discrete hub location problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the choice of step size in subgradient optimization
• A tree search algorithm for the p-median problem
• A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
• The simple plant location problem: Survey and synthesis
• Solving covering problems and the uncapacitated plant location problem on trees
• 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
• Probabilistic Analysis of the Planar k-Median Problem
• A Dual-Bounded Algorithm for the p-Median Problem
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Some facets of the simple plant location polytope
• A New Algorithm for Locating Sources Among Destinations
• A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
• 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
• An analysis of approximations for maximizing submodular set functions—I
• Facility Location with Price-Sensitive Demands: Private, Public, and Quasi-Public
• Validation of subgradient optimization
• 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
• The Location of Emergency Service Facilities
• Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem