A Lagrangian search method for the P-median problem

DOI10.1007/S10898-016-0481-XMaRDI QIDQ1675643zbMATH OpenOpenAlexFDO

Authors Joshua Q. Hale, Enlu Zhou, Jiming Peng

Publication date 2 November 2017

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-016-0481-x

zbMATH Keywords

stochastic searchLagrangian multipliers\(P\)-median problem

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 1247176
• A branch-and-price approach to p-median location problems
• A new heuristic approach for the P-median problem
• Solving the \(p\)-median problem with a semi-Lagrangian relaxation
• A hybrid heuristic for the \(p\)-median problem

Cites work

• scientific article; zbMATH DE number 4202014 (Why is no real title available?)
• scientific article; zbMATH DE number 2040689 (Why is no real title available?)
• scientific article; zbMATH DE number 2117227 (Why is no real title available?)
• A Dual-Bounded Algorithm for the p-Median Problem
• A Lagrangean heuristic for the maximal covering location problem
• A Model Reference Adaptive Search Method for Global Optimization
• A genetic algorithm for solving a capacitated \(p\)-median problem
• A hybrid heuristic for the \(p\)-median problem
• A note on solving large p-median problems
• A statistical analysis of simulated annealing applied to the p-median problem
• A survey on metaheuristics for stochastic combinatorial optimization
• Algorithms of ant system and simulated annealing for the \(p\)-median problem
• An efficient genetic algorithm for the \(p\)-median problem
• An efficient tabu search procedure for the \(p\)-median problem
• An exact cooperative method for the uncapacitated facility location problem
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Cluster Analysis: An Application of Lagrangian Relaxation
• Clustering for metric and nonmetric distance measures
• Defining tabu list size and aspiration criterion within tabu search methods
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Genetic clustering algorithms.
• Gradient-Based Adaptive Stochastic Search for Non-Differentiable Optimization
• Lagrangean heuristics for location problems
• Large neighborhood local search for the \(p\)-median problem
• Local Search Heuristics for k-Median and Facility Location Problems
• Model-based search for combinatorial optimization: A critical survey
• Solving the \(p\)-median problem with a semi-Lagrangian relaxation
• Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The \(p\)-median problem: a survey of metaheuristic approaches
• The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
• The parallel variable neighborhood search for the \(p\)-median problem
• The volume algorithm: Producing primal solutions with a subgradient method
• Variable neighborhood search for the p-median

Cited in

(4)

• A global optimization procedure for the location of a median line in the three-dimensional space
• The \(p\)-median problem: a survey of metaheuristic approaches
• The min-p robust optimization approach for facility location problem under uncertainty
• An exact column-generation approach for the lot-type design problem

Describes a project that uses

Uses Software

• OR-Library

This page was built for publication: A Lagrangian search method for the \(P\)-median problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1675643)