A Lagrangian search method for the \(P\)-median problem
From MaRDI portal
Publication:1675643
DOI10.1007/s10898-016-0481-xzbMath1408.90188OpenAlexW2546685961MaRDI QIDQ1675643
Jiming Peng, Joshua Q. Hale, Enlu Zhou
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
Related Items (2)
The min-p robust optimization approach for facility location problem under uncertainty ⋮ An exact column-generation approach for the lot-type design problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An exact cooperative method for the uncapacitated facility location problem
- A genetic algorithm for solving a capacitated \(p\)-median problem
- Model-based search for combinatorial optimization: A critical survey
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation
- The \(p\)-median problem: a survey of metaheuristic approaches
- A survey on metaheuristics for stochastic combinatorial optimization
- A note on solving large p-median problems
- A Lagrangean heuristic for the maximal covering location problem
- An efficient tabu search procedure for the \(p\)-median problem
- An efficient genetic algorithm for the \(p\)-median problem
- The volume algorithm: Producing primal solutions with a subgradient method
- A statistical analysis of simulated annealing applied to the \(p\)-median problem
- Lagrangean heuristics for location problems
- A hybrid heuristic for the \(p\)-median problem
- The parallel variable neighborhood search for the \(p\)-median problem
- Algorithms of ant system and simulated annealing for the \(p\)-median problem
- Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
- Clustering for metric and nonmetric distance measures
- Gradient-Based Adaptive Stochastic Search for Non-Differentiable Optimization
- Cluster Analysis: An Application of Lagrangian Relaxation
- A Model Reference Adaptive Search Method for Global Optimization
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
- A Dual-Bounded Algorithm for the p-Median Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Variable neighborhood search for the p-median
- Local Search Heuristics for k-Median and Facility Location Problems
- Large neighborhood local search for the p-median problem
- Genetic clustering algorithms.
- Defining tabu list size and aspiration criterion within tabu search methods
This page was built for publication: A Lagrangian search method for the \(P\)-median problem
