The heuristic concentration-integer and its application to a class of location problems
type: Item
instance of: scholarly article
title: The heuristic concentration-integer and its application to a class of location problems
zbMATH Open document ID: 1175.90258
author: Vladimir Marianov
author: Michelle Mizumori
author: C. S. Revelle
published in: Computers \& Operations Research
publication date: 2008-12-17T00:00:00Z
full work available at URL: http://hdl.handle.net/10533/142396
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5383129
zbMATH Keywords: facility location
zbMATH Keywords: heuristics
zbMATH Keywords: integer programming
MaRDI profile type: Publication
OpenAlex ID: W2041977780
cites work: Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
cites work: Heuristic concentration: Two stage solution construction
cites work: Heuristic concentration and tabu search: A head to head comparison
cites work: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
cites work: A gamma heuristic for the \(p\)-median problem
cites work: Heuristic concentration for the \(p\)-median: An example demonstrating how and why it works
cites work: The Maximum Availability Location Problem
cites work: The queueing maximal availability location problem: A model for the siting of emergency vehicles
cites work: Towards unified formulations and extensions of two classical probabilistic location models
cites work: A Lagrangean heuristic for the maximal covering location problem
DOI: 10.1016/J.COR.2008.02.011
description: scientific article; zbMATH DE number 5383129