A comparison of two dual-based procedures for solving the p-median problem
From MaRDI portal
Publication:1058960
DOI10.1016/0377-2217(85)90012-8zbMATH Open0565.90011OpenAlexW2019777133MaRDI QIDQ1058960FDOQ1058960
Authors: Pierre Hanjoul, Dominique Peeters 
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
computational experiments\(p\)-median problemcomparison of algorithmsalternative Lagrangean relaxationsdual-based procedures
Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)
Cites Work
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Facility Location with Price-Sensitive Demands: Private, Public, and Quasi-Public
- Title not available (Why is that?)
- Validation of subgradient optimization
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- The Location of Emergency Service Facilities
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An analysis of approximations for maximizing submodular set functions—I
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- The simple plant location problem: Survey and synthesis
- 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
- On the choice of step size in subgradient optimization
- A Dual-Bounded Algorithm for the p-Median Problem
- Technical Note—An Algorithm for the p-Median Problem
- Solving covering problems and the uncapacitated plant location problem on trees
- Some facets of the simple plant location polytope
- The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
- A tree search algorithm for the p-median problem
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- Title not available (Why is that?)
- A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
- Probabilistic Analysis of the Planar k-Median Problem
- Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median
- Title not available (Why is that?)
- A New Algorithm for Locating Sources Among Destinations
Cited In (26)
- BEAMR: an exact and approximate model for the \(p\)-median problem
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- Facility location models for distribution system design
- Optimal partitioning of a data set based on the \(p\)-median model
- On the exact solution of large-scale simple plant location problems
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- Integer programming formulations of discrete hub location problems
- Cluster analysis and mathematical programming
- Exemplar-based clustering via simulated annealing
- Unsupervised and supervised data classification via nonsmooth and global optimization (with comments and rejoinder)
- A network location-allocation model trading off flow capturing and \(p\)- median objectives
- Lagrangean heuristics for location problems
- Affinity propagation and uncapacitated facility location problems
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
- Fast modified global \(k\)-means algorithm for incremental cluster construction
- Analyzing tradeoffs between zonal constraints and accessibility in facility location
- \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
- An algorithm for minimizing clustering functions
- Lagrangean relaxation-based techniques for solving facility location problems
- Solving the anti-covering location problem using Lagrangian relaxation
- Modified global \(k\)-means algorithm for minimum sum-of-squares clustering problems
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- A method for solving to optimality uncapacitated location problems
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- Heuristics for location models
This page was built for publication: A comparison of two dual-based procedures for solving the p-median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1058960)
