| 2008 |
|---|
| 32 | | Edoardo Amaldi,
Giulia Galbiati,
Francesco Maffioli:
On minimum reload cost paths, tours and flows.
CTW 2008: 112-115 |
| 31 | | Edoardo Amaldi,
Alberto Ceselli,
Kanika Dhyani:
Column Generation for the Minimum Hyperplanes Clustering Problem.
CTW 2008: 162-166 |
| 30 | EE | Jonatha Anselmi,
Edoardo Amaldi,
Paolo Cremonesi:
Service Consolidation with End-to-End Response Time Constraints.
SEAA 2008: 345-352 |
| 29 | EE | Edoardo Amaldi,
Antonio Capone,
Matteo Cesana,
Ilario Filippini,
Federico Malucelli:
Optimization models and methods for planning wireless mesh networks.
Computer Networks 52(11): 2159-2171 (2008) |
| 28 | EE | Edoardo Amaldi,
Maurizio Bruglieri,
Giuliano Casale:
A two-phase relaxation-based heuristic for the maximum feasible subsystem problem.
Computers & OR 35(5): 1465-1482 (2008) |
| 27 | EE | Edoardo Amaldi,
Antonio Capone,
Federico Malucelli:
Radio planning and coverage optimization of 3G cellular networks.
Wireless Networks 14(4): 435-447 (2008) |
| 2007 |
|---|
| 26 | EE | Edoardo Amaldi,
Antonio Capone,
Matteo Cesana,
Federico Malucelli:
Optimization Models for the Radio Planning of Wireless Mesh Networks.
Networking 2007: 287-298 |
| 25 | EE | A. Altin,
Edoardo Amaldi,
Pietro Belotti,
Mustafa Ç. Pinar:
Provisioning virtual private networks under traffic uncertainty.
Networks 49(1): 100-115 (2007) |
| 2006 |
|---|
| 24 | EE | Edoardo Amaldi,
Pietro Belotti,
Antonio Capone,
Federico Malucelli:
Optimizing base station location and configuration in UMTS networks.
Annals OR 146(1): 135-151 (2006) |
| 2005 |
|---|
| 23 | EE | Edoardo Amaldi,
Pietro Belotti,
Raphael Hauser:
Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem.
IPCO 2005: 249-264 |
| 2004 |
|---|
| 22 | EE | Edoardo Amaldi,
Antonio Capone,
Matteo Cesana,
Luigi Fratta,
Federico Malucelli:
Algorithms for WLAN Coverage Planning.
EuroNGI Workshop 2004: 52-65 |
| 21 | EE | Edoardo Amaldi,
Leo Liberti,
Nelson Maculan,
Francesco Maffioli:
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases.
WEA 2004: 14-29 |
| 20 | EE | A. Altin,
Edoardo Amaldi,
Pietro Belotti,
Mustafa Ç. Pinar:
Virtual Private Network Design Under Traffic Uncertainty.
Electronic Notes in Discrete Mathematics 17: 19-22 (2004) |
| 19 | EE | Edoardo Amaldi,
Leo Liberti,
Francesco Maffioli,
Nelson Maculan:
Algorithms for finding minimum fundamental cycle bases in graphs.
Electronic Notes in Discrete Mathematics 17: 29-33 (2004) |
| 2003 |
|---|
| 18 | EE | Edoardo Amaldi,
Antonio Capone,
Federico Malucelli,
Francesco Signori:
Radio Planning and Optimization of W-CDMA Systems.
PWC 2003: 437-447 |
| 17 | EE | Giulia Galbiati,
Edoardo Amaldi:
On the Approximability of the Minimum Fundamental Cycle Basis Problem.
WAOA 2003: 151-164 |
| 16 | EE | Edoardo Amaldi,
Antonio Capone,
Federico Malucelli:
Discrete models and algorithms for packet scheduling in smart antennas.
Electronic Notes in Discrete Mathematics 13: 1-4 (2003) |
| 15 | EE | Edoardo Amaldi,
Marc E. Pfetsch,
Leslie E. Trotter Jr.:
On the maximum feasible subsystem problem, IISs and IIS-hypergraphs.
Math. Program. 95(3): 533-554 (2003) |
| 2002 |
|---|
| 14 | | Edoardo Amaldi,
Marco Mattavelli:
The MIN PFS problem and piecewise linear model estimation.
Discrete Applied Mathematics 118(1-2): 115-143 (2002) |
| 2001 |
|---|
| 13 | EE | Edoardo Amaldi,
Antonio Capone,
Federico Malucelli:
Discrete models and algorithms for the capacitated location problems arising in UMTS network planning.
DIAL-M 2001: 1-8 |
| 12 | EE | Marco Mattavelli,
Vincent Noel,
Edoardo Amaldi:
Fast Line Detection Algorithms Based on Combinatorial Optimization.
IWVF 2001: 410-419 |
| 1999 |
|---|
| 11 | EE | Marco Mattavelli,
Vincent Noel,
Edoardo Amaldi:
A New Approach for Fast Line Detection Based on Combinatorial Optimization.
ICIAP 1999: 168-173 |
| 10 | EE | Edoardo Amaldi,
Marc E. Pfetsch,
Leslie E. Trotter Jr.:
Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem.
IPCO 1999: 45-59 |
| 1998 |
|---|
| 9 | | Marco Mattavelli,
Vincent Noel,
Edoardo Amaldi:
An Efficient Line Detection Algorithm based on a New Combinatorial Optimization Formulation.
ICIP (3) 1998: 65-69 |
| 8 | EE | Edoardo Amaldi,
Viggo Kann:
On the Approximability of Minimizing Nonzero Variables or Unsatisfied Relations in Linear Systems.
Theor. Comput. Sci. 209(1-2): 237-260 (1998) |
| 1997 |
|---|
| 7 | | Marco Mattavelli,
Edoardo Amaldi,
Jean-Marc Vesin:
A Perceptron-Based Approach to Piecewise Linear Modeling with an Application to Time Series.
ICANN 1997: 547-552 |
| 6 | EE | Edoardo Amaldi,
Bertrand Guenin:
Two Constructive Methods for Designing Compact Feedforward Networks of Threshold Units.
Int. J. Neural Syst. 8(5-6): 629-645 (1997) |
| 1996 |
|---|
| 5 | EE | Edoardo Amaldi,
Viggo Kann:
On the approximability of some NP-hard minimization problems for linear systems
Electronic Colloquium on Computational Complexity (ECCC) 3(15): (1996) |
| 1995 |
|---|
| 4 | EE | Edoardo Amaldi,
Viggo Kann:
The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations.
Theor. Comput. Sci. 147(1&2): 181-210 (1995) |
| 1994 |
|---|
| 3 | | Edoardo Amaldi,
Viggo Kann:
On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems.
STACS 1994: 521-532 |
| 2 | EE | Edoardo Amaldi,
Eddy Mayoraz,
Dominique de Werra:
A Review of Combinatorial Problems Arising in Feedforward Neural Network Design.
Discrete Applied Mathematics 52(2): 111-138 (1994) |
| 1991 |
|---|
| 1 | EE | Roberto Battiti,
Edoardo Amaldi,
Christof Koch:
Computing optical flow across multiple scales: An adaptive coarse-to-fine strategy.
International Journal of Computer Vision 6(2): 133-145 (1991) |
