The discrete p-dispersion problem
type: Item
instance of: scholarly article
title: The discrete p-dispersion problem
zbMATH Open document ID: 0702.90050
DOI: 10.1016/0377-2217(90)90297-O
author: Erhan Erkut
published in: European Journal of Operational Research
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 4152139
zbMATH Keywords: undesirable facilities
zbMATH Keywords: dispersion
zbMATH Keywords: branch-and-bound
zbMATH Keywords: heuristic
zbMATH Keywords: facility locations
MaRDI profile type: Publication
cites work: Finding a Maximum Clique in an Arbitrary Graph
cites work: Location on Tree Networks: P-Centre and n-Dispersion Problems
cites work: An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree
cites work: Polynomially bounded algorithms for locatingp-centers on a tree
cites work: Q4083324
cites work: Analytical models for locating undesirable facilities
cites work: Q4198056
cites work: Semi-greedy heuristics: An empirical study
cites work: An Algorithmic Approach to Network Location Problems. I: Thep-Centers
cites work: The m-Center Problem
cites work: Relations between packing and covering numbers of a tree
cites work: An Analysis of Network Location Problems with Distance Constraints
cites work: State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
cites work: Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
full work available at URL: 0377-2217(90)90297-o
OpenAlex ID: W1986998000
description: scientific article; zbMATH DE number 4152139