Search Results for author:
Found 6 papers, 0 papers with code
A hybrid primal heuristic for Robust Multiperiod Network Design
Given the intrinsic difficulty of the problem, which proves challenging even for state-of-the art commercial solvers, we propose a hybrid primal heuristic based on the combination of ant colony optimization and an exact large neighborhood search.
A hybrid exact-ACO algorithm for the joint scheduling, power and cluster assignment in cooperative wireless networks
Implementing BSC adds a new design dimension to the classical wireless network design problem: how to define the subset of base stations (clusters) that coordinate to serve a user.
On Improving the Capacity of Solving Large-scale Wireless Network Design Problems by Genetic Algorithms
In this work, we present a Genetic Algorithm for solving large instances of the Power, Frequency and Modulation Assignment Problem, arising in the design of wireless networks.
A fast ILP-based Heuristic for the robust design of Body Wireless Sensor Networks
We consider the problem of optimally designing a body wireless sensor network, while taking into account the uncertainty of data generation of biosensors.
An (MI)LP-based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design
We investigate the 3-architecture Connected Facility Location Problem arising in the design of urban telecommunication access networks.
A Fast Hybrid Primal Heuristic for Multiband Robust Capacitated Network Design with Multiple Time Periods
We investigate the Robust Multiperiod Network Design Problem, a generalization of the Capacitated Network Design Problem (CNDP) that, besides establishing flow routing and network capacity installation as in a canonical CNDP, also considers a planning horizon made up of multiple time periods and protection against fluctuations in traffic volumes.
