A maxmin location problem with nonconvex feasible region |
| |
| Authors: | F Fernandez J Puerto A M Rodriguez–chia |
| |
| Affiliation: | 1.Universidad de Cadiz,;2.Universidad de Sevilla,Spain |
| |
| Abstract: | The problem dealt with consists of locating a point in a given convex polyhedron which maximizes the minimum Euclidean distance from a given set of convex polyhedra representing protected areas around population points. The paper describes a finite dominating solution set for the optimal solution and develops a geometrical procedure for obtaining the optimal solution comparing a finite number of candidates. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
