Comparison Of Four Models For dispersing Facilities

DOI10.1080/03155986.1991.11732157zbMath0732.90054OpenAlexW145436563MaRDI QIDQ3359994

Susan Neuman, Erhan Erkut

Publication date: 1991

Published in: INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03155986.1991.11732157

zbMATH Keywords

heuristicimplicit enumerationcandidate pointsdispersed subsetminimum distance separation constraints

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (17)

A comparison of \(p\)-dispersion heuristics ⋮ On the unified dispersion problem: efficient formulations and exact algorithms ⋮ Facility dispersion and remote subgraphs ⋮ Maxminmin \(p\)-dispersion problem: a variable neighborhood search approach ⋮ Review of obnoxious facilities location problems ⋮ Location Science in Canada ⋮ A linear time approximation scheme for computing geometric maximum \(k\)-star ⋮ Formulations and valid inequalities for the capacitated dispersion problem ⋮ Alternative formulations for the obnoxious \(p\)-median problem ⋮ A branch-and-cut method for the obnoxious \(p\)-median problem ⋮ An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation ⋮ \(t\)-linearization for the maximum diversity problem ⋮ Good solutions to discrete noxious location problems via metaheuristics ⋮ Construction and improvement algorithms for dispersion problems ⋮ Fast approximation algorithms for \(p\)-centers in large \(\delta\)-hyperbolic graphs ⋮ Integer-friendly formulations for the \(r\)-separation problem ⋮ A hybrid metaheuristic method for the maximum diversity problem

This page was built for publication: Comparison Of Four Models For dispersing Facilities