A maxmin location problem with nonconvex feasible region

DOI10.1057/palgrave.jors.2600382zbMath0882.90085OpenAlexW1989965063MaRDI QIDQ4347413

Antonio M. Rodríguez-Chía, Francisco Ramón Fernández García, Justo Puerto

Publication date: 10 March 1998

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600382

zbMATH Keywords

non-convex programmingobnoxious facilityminimum Euclidean distancegeometrical procedurelocating a point in a given convex polyhedron

Mathematics Subject Classification ID

Continuous location (90B85) Nonconvex programming, global optimization (90C26)

Related Items (2)

Locating waste pipelines to minimize their impact on marine environment ⋮ A continuous location model for siting a non-noxious undesirable facility within a geographical region

This page was built for publication: A maxmin location problem with nonconvex feasible region