Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Control Abstractions for Local Search
Constraints
Constraint-Based Local Search
Approximating the two-level facility location problem via a quasi-greedy approach
Mathematical Programming: Series A and B
A hybrid constraint model for the routing and wavelength assignment problem
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Symmetry and search in a network design problem
CPAIOR'05 Proceedings of the Second international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Ethernet passive optical network (EPON): building a next-generation optical access network
IEEE Communications Magazine
Near-optimal solutions to large-scale facility location problems
Discrete Optimization
A heuristic algorithm for a prize-collecting local access network design problem
INOC'11 Proceedings of the 5th international conference on Network optimization
| Hi-index | 0.00 |
We present a class of problems that arise in the design of the Next Generation Access Networks. The main features of these networks are: to be based on fiber links of relatively long length with respect to traditional copper based networks, users may be reached directly by fibers, and the presence of few central offices managing a large number of users. We present an Integer Programming model that captures the technological constraints and the deployment costs. The model serves as a basis for a decision support tool in the design of the Next Generation Access Networks. Pure Integer Programming cannot handle real-life problem instances, giving rise to new challenges and opportunities for hybrid Constraint Programming-Mathematical Programming methods. In this paper, we compare a LP-based randomized rounding algorithm with a Constraint-based Local Search formulation. The use of an LP relaxation is twofold: it gives lower bounds to the optimal solution, and it is easily embedded into a randomized rounding algorithm. The Constraint-based Local Search algorithm is then exploited to explore the set of feasible solutions. With these algorithms we are able to solve real-life instances for one of the problems presented in this paper.