| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10327366 | Computational Geometry | 2015 | 10 Pages |
Abstract
In this paper, we present an exact algorithm based on integer linear programming for solving the NP-hard natural wireless localization problem. The efficiency of our algorithm is certified by experimental results comprising the solutions of 720 instances, including polygon with holes, of up to 1000 vertices, in less than fifteen minutes on a standard desktop computer.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Bruno E. Crepaldi, Pedro J. de Rezende, Cid C. de Souza,