The discrete p-maxian location problem

DOI10.1016/0305-0548(90)90027-5zbMath0682.90038OpenAlexW2031426424MaRDI 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

heuristicenumeration schemecandidate pointsdiscrete p-maxian locationobnoxious facilities location

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)

Related Items (11)

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

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

This page was built for publication: The discrete p-maxian location problem