A Lagrangian search method for the \(P\)-median problem
type: Item
instance of: scholarly article
title: A Lagrangian search method for the \(P\)-median problem
zbMATH Open document ID: 1408.90188
author: Joshua Q. Hale
author: Enlu Zhou
author: Jiming Peng
published in: Journal of Global Optimization
publication date: 2017-11-02T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6802553
zbMATH Keywords: \(P\)-median problem
zbMATH Keywords: stochastic search
zbMATH Keywords: Lagrangian multipliers
describes a project that uses: OR-Library
MaRDI profile type: Publication
full work available at URL: s10898-016-0481-x
OpenAlex ID: W2546685961
cites work: Clustering for metric and nonmetric distance measures
cites work: An efficient genetic algorithm for the \(p\)-median problem
cites work: Local Search Heuristics for k-Median and Facility Location Problems
cites work: The volume algorithm: Producing primal solutions with a subgradient method
cites work: A note on solving large p-median problems
cites work: Lagrangean heuristics for location problems
cites work: Solving the \(p\)-median problem with a semi-Lagrangian relaxation
cites work: A survey on metaheuristics for stochastic combinatorial optimization
cites work: Genetic clustering algorithms.
cites work: A statistical analysis of simulated annealing applied to the \(p\)-median problem
cites work: Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
cites work: Q3351135
cites work: A genetic algorithm for solving a capacitated \(p\)-median problem
cites work: Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems
cites work: A Dual-Bounded Algorithm for the p-Median Problem
cites work: A Lagrangean heuristic for the maximal covering location problem
cites work: The parallel variable neighborhood search for the \(p\)-median problem
cites work: Variable neighborhood search for the p-median
cites work: A Model Reference Adaptive Search Method for Global Optimization
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: Large neighborhood local search for the p-median problem
cites work: Algorithms of ant system and simulated annealing for the \(p\)-median problem
cites work: Q4449755
cites work: The \(p\)-median problem: a survey of metaheuristic approaches
cites work: Cluster Analysis: An Application of Lagrangian Relaxation
cites work: An exact cooperative method for the uncapacitated facility location problem
cites work: A hybrid heuristic for the \(p\)-median problem
cites work: An efficient tabu search procedure for the \(p\)-median problem
cites work: The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
cites work: Q4828558
cites work: Defining tabu list size and aspiration criterion within tabu search methods
cites work: Gradient-Based Adaptive Stochastic Search for Non-Differentiable Optimization
cites work: Model-based search for combinatorial optimization: A critical survey
DOI: 10.1007/S10898-016-0481-X
description: scientific article; zbMATH DE number 6802553