Name
Abstract | ||
|---|---|---|
The p-center problem is one of the classical facility location problems. It finds applications in several different fields, including network planning and network optimization. Due to the increasing of bandwidth requirements, telecommunication operators are renewing the access networks in favoring of optical networks. Generally, the design of access network consists in determining the location of physical networks from a given list of potential locations. Indeed, in order to ensure the efficient usage of a limited number of resources, the identification of facility locations plays a central role.In this paper, we formally define the p-center problem, briefly survey the most efficient state of the art algorithms to approach it, and describe a new smart and fast local search able to find optimal or near-optimal solutions. We also discuss and analyze the results of our extensive computational experience on benchmark instances and on optical network instances. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/ICTON.2017.8024978 | 2017 19TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON) |
DocType | ISSN | Citations |
Conference | 2162-7339 | 0 |
PageRank | References | Authors |
0.34 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| daniele ferone | 1 | 19 | 5.78 |
| Paola Festa | 2 | 287 | 25.32 |
| Antonio Napoletano | 3 | 0 | 1.01 |
| Mauricio G. C. Resende | 4 | 3729 | 336.98 |