The discrete p-maxian location problem
type: Item
instance of: scholarly article
title: The discrete p-maxian location problem
zbMATH Open document ID: 0682.90038
DOI: 10.1016/0305-0548(90)90027-5
author: Erhan Erkut
author: Thomas Baptie
author: Balder von Hohenbalken
published in: Computers \& Operations Research
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 4118133
zbMATH Keywords: discrete p-maxian location
zbMATH Keywords: obnoxious facilities location
zbMATH Keywords: candidate points
zbMATH Keywords: enumeration scheme
zbMATH Keywords: heuristic
MaRDI profile type: Publication
full work available at URL: 0305-0548(90)90027-5
OpenAlex ID: W2031426424
cites work: A Maxmin Location Problem
cites work: Analytical models for locating undesirable facilities
cites work: Locating an undesirable facility with a minimax criterion
cites work: Q4867320
cites work: Location on Tree Networks: P-Centre and n-Dispersion Problems
cites work: Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
cites work: The discrete p-dispersion problem
cites work: An Analysis of Network Location Problems with Distance Constraints
description: scientific article; zbMATH DE number 4118133