Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
An introduction to support Vector Machines: and other kernel-based learning methods
An introduction to support Vector Machines: and other kernel-based learning methods
Weber‘s Problem with Attraction and Repulsion under Polyhedral Gauges
Journal of Global Optimization
A D.C. biobjective location model
Journal of Global Optimization
Discrete location problems with push-pull objectives
Discrete Applied Mathematics
Semi-obnoxious single facility location in Euclidean space
Computers and Operations Research
Euclidean push-pull partial covering problems
Computers and Operations Research
Locating a semi-obnoxious facility with expropriation
Computers and Operations Research
SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
An interactive solution approach for a bi-objective semi-desirable location problem
Journal of Global Optimization
Locating Objects in the Plane Using Global Optimization Techniques
Mathematics of Operations Research
| Hi-index | 0.04 |
A facility is to be located in the Euclidean plane to serve certain sites by covering them closely. Simultaneously, a set of polygonal areas must be protected from the negative effects from that facility. The problem is formulated as a margin maximization model. Necessary optimality conditions are studied and a finite dominating set of solutions is obtained, leading to a polynomial algorithm. The method is illustrated on some examples.