Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
On the Approximability of Minimizing Nonzero Variables or Unsatisfied Relations in Linear Systems
Planning UMTS base station location: optimization models with power control and algorithms
- E. Amaldi, A. Capone, F. Malucelli
- Computer Science, BusinessIEEE Trans. Wirel. Commun.
- 1 September 2003
Two randomized greedy procedures and a tabu search algorithm for the uplink (mobile to BS) direction which is the most stringent one from the traffic point of view in the presence of balanced connections such as voice calls are proposed.
The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations
Optimization models and methods for planning wireless mesh networks
On the Hazmat Transport Network Design Problem
This work proves that the version of the hazmat transport network design problem where a subset of arcs can be forbidden is NP-hard even when a single commodity has to be shipped.
Energy-aware IP traffic engineering with shortest path routing
The MIN PFS problem and piecewise linear model estimation
Provisioning virtual private networks under traffic uncertainty
This work investigates a network design problem under traffic uncertainty that arises when provisioning Virtual Private Networks and presents compact linear mixed‐integer programming formulations for the problem with the classical hose traffic model and for a less conservative robust variant relying on the traffic statistics that are often available.
On the computational complexity of the virtual network embedding problem
WLAN coverage planning: optimization models and algorithms
- E. Amaldi, A. Capone, M. Cesana, F. Malucelli, F. Palazzo
- Business, Computer ScienceIEEE 59th Vehicular Technology Conference. VTC…
- 17 May 2004
This paper describes the optimization models with hyperbolic and quadratic objective functions that directly accounts system capacity and proposes heuristics combining greedy and local search phases that provide near-optimal solutions within a reasonable amount of time.