Neighborhood search heuristics for the uncapacitated facility location problem
type: Item
instance of: scholarly article
title: Neighborhood search heuristics for the uncapacitated facility location problem
zbMATH Open document ID: 1023.90524
DOI: 10.1016/S0377-2217(02)00504-0
author: Diptesh Ghosh
published in: European Journal of Operational Research
publication date: 2003-08-13T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1963895
zbMATH Keywords: uncapacitated facility location
zbMATH Keywords: heuristics
zbMATH Keywords: greedy
zbMATH Keywords: local search
zbMATH Keywords: tabu search
zbMATH Keywords: complete local search with memory
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Methods of finding all minimum coverings of a graph by cliques
cites work: Q4083324
cites work: Q3351135
cites work: A Dual-Based Procedure for Uncapacitated Facility Location
cites work: A competitive local search heuristic for the subset sum problem
cites work: Q4354785
cites work: On the exact solution of large-scale simple plant location problems
cites work: Q3993417
cites work: The Assortment Problem with Nonlinear Cost Functions
cites work: The Discrete Two-Dimensional Assortment Problem
cites work: The Plant Location Problem: New Models and Research Prospects
cites work: An efficient tabu search procedure for the \(p\)-median problem
cites work: A two-phase tabu search approach to the location routing problem
full work available at URL: s0377-2217(02)00504-0
OpenAlex ID: W2081029938
description: scientific article; zbMATH DE number 1963895