The discrete p-maxian location problem

DOI10.1016/0305-0548(90)90027-5zbMath0682.90038MaRDI QIDQ1824542

Erhan Erkut, Balder von Hohenbalken, Thomas Baptie

Publication date: 1990

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(90)90027-5

zbMATH Keywords

heuristic; enumeration scheme; candidate points; discrete p-maxian location; obnoxious facilities location

Mathematics Subject Classification ID

90C27: Combinatorial optimization

90B05: Inventory, storage, reservoirs

90C09: Boolean programming

Related Items

Unnamed Item, A Lagrangian relaxation approach to the edge-weighted clique problem, The \(p\)-Maxian problem on interval graphs, Good solutions to discrete noxious location problems via metaheuristics, Computational geometric aspects of rhythm, melody, and voice-leading, A branch-and-cut method for the obnoxious \(p\)-median problem, Analytical models for locating undesirable facilities, Public facility location using dispersion, population, and equity criteria, Maximum diversity/similarity models with extension to part grouping

Cites Work

• Unnamed Item
• The discrete p-dispersion problem
• Locating an undesirable facility with a minimax criterion
• Analytical models for locating undesirable facilities
• An Analysis of Network Location Problems with Distance Constraints
• A Maxmin Location Problem
• Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
• Location on Tree Networks: P-Centre and n-Dispersion Problems