Edoardo Amaldi

Publication Activity (10 Years)

Years Active: 1991-2023
Publications (10 Years): 11

Top Topics

Optimization Method

Decomposition Method

Traffic Engineering

Top Venues

Comput. Oper. Res.

Electron. Notes Discret. Math.

IEEE Trans. Serv. Comput.

Publications

Edoardo Amaldi, Antonio Consolo, Andrea Manno
On multivariate randomized classification trees: l0-based sparsity, VC dimension and decomposition methods. Comput. Oper. Res. 151 (2023)
Federica Filippini, Marco Lattuada, Michele Ciavotta, Arezoo Jahani, Danilo Ardagna, Edoardo Amaldi
A Path Relinking Method for the Joint Online Scheduling and Capacity Allocation of DL Training Workloads in GPU as a Service Systems. IEEE Trans. Serv. Comput. 16 (3) (2023)
Edoardo Amaldi, Antonio Consolo, Andrea Manno
-based sparsity, VC dimension and decomposition methods. CoRR (2021)
Federica Filippini, Danilo Ardagna, Marco Lattuada, Edoardo Amaldi, Maciek Riedl, Katarzyna Materka, Pawel Skrzypek, Michele Ciavotta, Fabrizio Magugliani, Marco Cicala
ANDREAS: Artificial intelligence traiNing scheDuler foR accElerAted resource clusterS. FiCloud (2021)
Federica Filippini, Danilo Ardagna, Marco Lattuada, Edoardo Amaldi, Michele Ciavotta, Maciek Riedl, Katarzyna Materka, Pawel Skrzypek, Fabrizio Magugliani, Marco Cicala
ANDREAS: Artificial intelligence traiNing scheDuler foR accElerAted resource clusterS. CoRR (2021)
Federica Filippini, Marco Lattuada, Arezoo Jahani, Michele Ciavotta, Danilo Ardagna, Edoardo Amaldi
Hierarchical Scheduling in on-demand GPU-as-a-Service Systems. SYNASC (2020)
Stefano Coniglio, Luca Giovanni Gianoli, Edoardo Amaldi, Antonio Capone
Elastic Traffic Engineering Subject to a Fair Bandwidth Allocation via Bilevel Programming. IEEE/ACM Trans. Netw. 28 (6) (2020)
Arezoo Jahani, Marco Lattuada, Michele Ciavotta, Danilo Ardagna, Edoardo Amaldi, Li Zhang
Optimizing on-demand GPUs in the Cloud for Deep Learning Applications Training. ICCCS (2019)
Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari
Discrete optimization methods to fit piecewise affine models to data points. Comput. Oper. Res. 75 (2016)
Edoardo Amaldi, Stefano Coniglio, Arie M. C. A. Koster, Martin Tieves
On the computational complexity of the virtual network embedding problem. Electron. Notes Discret. Math. 52 (2016)
Jean Respen, Nicolas Zufferey, Edoardo Amaldi
Metaheuristics for a job scheduling problem with smoothing costs relevant for the car industry. Networks 67 (3) (2016)
Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari
Maximum Throughput Network Routing Subject to Fair Flow Allocation. ISCO (2014)
Emanuele Martelli, Edoardo Amaldi
PGS-COM: A hybrid method for constrained non-smooth black-box optimization problems: Brief review, novel algorithm and comparative evaluation. Comput. Chem. Eng. 63 (2014)
Edoardo Amaldi, Stefano Coniglio, Stefano Gualandi
Coordinated cutting plane generation via multi-objective separation. Math. Program. 143 (1-2) (2014)
Simone Casale Brunet, Endri Bezati, Claudio Alberti, Marco Mattavelli, Edoardo Amaldi, Jörn W. Janneck
Multi-clock domain optimization for reconfigurable architectures in high-level dataflow applications. ACSSC (2013)
Edoardo Amaldi, Antonio Capone, Luca Giovanni Gianoli
Energy-aware IP traffic engineering with shortest path routing. Comput. Networks 57 (6) (2013)
Edoardo Amaldi, Antonio Capone, Stefano Coniglio, Luca Giovanni Gianoli
Network Optimization Problems Subject to Max-Min Fair Flow Allocation. IEEE Commun. Lett. 17 (7) (2013)
Edoardo Amaldi, Federico Malucelli
In memoriam of Francesco Maffioli (1941-2012). Int. Trans. Oper. Res. 20 (3) (2013)
Giulio Betti, Edoardo Amaldi, Antonio Capone, Giulia Ercolani
Cost-aware optimization models for communication networks with renewable energy sources. INFOCOM Workshops (2013)
Alessandro Redondi, Edoardo Amaldi
Optimizing the placement of anchor nodes in RSS-based indoor localization systems. Med-Hoc-Net (2013)
Edoardo Amaldi, Antonio Capone, Stefano Coniglio, Luca Giovanni Gianoli
Energy-aware traffic engineering with elastic demands and MMF bandwidth allocation. CAMAD (2013)
Edoardo Amaldi, Stefano Coniglio, Luca Giovanni Gianoli, Can Umut Ileri
On single-path network routing subject to max-min fair flow allocation. Electron. Notes Discret. Math. 41 (2013)
Simone Casale Brunet, Endri Bezati, Claudio Alberti, Marco Mattavelli, Edoardo Amaldi, Jörn W. Janneck
Partitioning and optimization of high level stream applications for multi clock domain architectures. SiPS (2013)
Edoardo Amaldi, Kanika Dhyani, Alberto Ceselli
Column Generation for the Minimum Hyperplanes Clustering Problem. INFORMS J. Comput. 25 (3) (2013)
Edoardo Amaldi, Kanika Dhyani, Leo Liberti
-hyperplane clustering problem. Comput. Optim. Appl. 56 (3) (2013)
Giulio Betti, Edoardo Amaldi, Antonio Capone, Giulia Ercolani
Cost-aware optimization models for communication networks with renewable energy sources. INFOCOM (2013)
Edoardo Amaldi, Stefano Coniglio
A distance-based point-reassignment heuristic for the k-hyperplane clustering problem. Eur. J. Oper. Res. 227 (1) (2013)
Edoardo Amaldi, Antonio Capone, Matteo Cesana, Ilario Filippini
Design of Wireless Sensor Networks for Mobile Target Detection. IEEE/ACM Trans. Netw. 20 (3) (2012)
Edoardo Amaldi, Sandro Bosio, Federico Malucelli
Hyperbolic set covering problems with competing ground-set elements. Math. Program. 134 (2) (2012)
Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari
k-Piecewise Affine Model Fitting: Heuristics Based on Multiway Linear Classification. CTW (2012)
Edoardo Amaldi, Antonio Capone, Luca Giovanni Gianoli, Luca Mascetti
A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing. INOC (2011)
Emanuele Martelli, Edoardo Amaldi, Stefano Consonni
Numerical optimization of heat recovery steam cycles: Mathematical model, two-stage algorithm and applications. Comput. Chem. Eng. 35 (12) (2011)
Bakir Lacevic, Edoardo Amaldi
Ectropy of diversity measures for populations in Euclidean space. Inf. Sci. 181 (11) (2011)
Edoardo Amaldi, Sandro Bosio, Federico Malucelli, Di Yuan
Solving Nonlinear Covering Problems Arising in WLAN Design. Oper. Res. 59 (1) (2011)
Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari
Formulations and heuristics for the k-Piecewise Affine Model Fitting problem. CTW (2011)
Giulia Galbiati, Romeo Rizzi, Edoardo Amaldi
On the approximability of the minimum strictly fundamental cycle basis problem. Discret. Appl. Math. 159 (4) (2011)
Edoardo Amaldi, Antonio Capone, Luca Giovanni Gianoli, Luca Mascetti
Energy management in IP traffic engineering with Shortest Path routing. WOWMOM (2011)
Edoardo Amaldi, Giulia Galbiati, Francesco Maffioli
On minimum reload cost paths, tours, and flows. Networks 57 (3) (2011)
Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi
On cycle bases with limited edge overlap. CTW (2011)
Edoardo Amaldi, Maurizio Bruglieri, Bernard Fortz
On the Hazmat Transport Network Design Problem. INOC (2011)
Edoardo Amaldi, Bernard Fortz, Claudio Iuliano
On Finding a Minimum Weight Cycle Basis with Cycles of Bounded Length. CTW (2010)
Edoardo Amaldi, Stefano Coniglio, Stefano Gualandi
Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation. SEA (2010)
Bakir Lacevic, Edoardo Amaldi
On population diversity measures in Euclidean space. IEEE Congress on Evolutionary Computation (2010)
Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. IPCO (2010)
Jonatha Anselmi, Paolo Cremonesi, Edoardo Amaldi
On the Consolidation of Data-Centers with Performance Constraints. QoSA (2009)
Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi
n) Barrier for Minimum Cycle Bases. ESA (2009)
Edoardo Amaldi, Leo Liberti, Francesco Maffioli, Nelson Maculan
Edge-swapping algorithms for the minimum fundamental cycle basis problem. Math. Methods Oper. Res. 69 (2) (2009)
Edoardo Amaldi, Stefano Coniglio, Kanika Dhyani
k-Hyperplane Clustering Problem: Column Generation and a Metaheuristic. CTW (2009)
Edoardo Amaldi, Maurizio Bruglieri, Giuliano Casale
A two-phase relaxation-based heuristic for the maximum feasible subsystem problem. Comput. Oper. Res. 35 (5) (2008)
Edoardo Amaldi, Antonio Capone, Matteo Cesana, Ilario Filippini, Federico Malucelli
Optimization models and methods for planning wireless mesh networks. Comput. Networks 52 (11) (2008)
Edoardo Amaldi, Antonio Capone, Matteo Cesana, Ilario Filippini
Coverage planning of Wireless Sensors for mobile target detection. MASS (2008)
Edoardo Amaldi, Alberto Ceselli, Kanika Dhyani
Column Generation for the Minimum Hyperplanes Clustering Problem. CTW (2008)
Edoardo Amaldi, Antonio Capone, Federico Malucelli
Radio planning and coverage optimization of 3G cellular networks. Wirel. Networks 14 (4) (2008)
Edoardo Amaldi, Giulia Galbiati, Francesco Maffioli
On minimum reload cost paths, tours and flows. CTW (2008)
Jonatha Anselmi, Edoardo Amaldi, Paolo Cremonesi
Service Consolidation with End-to-End Response Time Constraints. EUROMICRO-SEAA (2008)
Edoardo Amaldi, Antonio Capone, Matteo Cesana, Federico Malucelli
Optimization Models for the Radio Planning of Wireless Mesh Networks. Networking (2007)
Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar
Provisioning virtual private networks under traffic uncertainty. Networks 49 (1) (2007)
Edoardo Amaldi, Pietro Belotti, Antonio Capone, Federico Malucelli
Optimizing base station location and configuration in UMTS networks. Ann. Oper. Res. 146 (1) (2006)
Edoardo Amaldi, Pietro Belotti, Raphael Hauser
Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem. IPCO (2005)
Edoardo Amaldi, Raphael Hauser
Boundedness Theorems for the Relaxation Method. Math. Oper. Res. 30 (4) (2005)
Edoardo Amaldi, Leo Liberti, Francesco Maffioli
Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs. CTW (2004)
Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar
Virtual Private Network Design Under Traffic Uncertainty. CTW (2004)
Edoardo Amaldi, Antonio Capone, Federico Malucelli, Gianluca Villa
Optimization of packet scheduling in wireless systems with smart antennas: geometric models and algorithms. ICC (2004)
Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. WEA (2004)
Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar
Virtual Private Network Design Under Traffic Uncertainty. Electron. Notes Discret. Math. 17 (2004)
Edoardo Amaldi, Antonio Capone, Matteo Cesana, Luigi Fratta, Federico Malucelli
Algorithms for WLAN Coverage Planning. EuroNGI Workshop (2004)
Edoardo Amaldi, Leo Liberti, Francesco Maffioli, Nelson Maculan
Algorithms for finding minimum fundamental cycle bases in graphs. Electron. Notes Discret. Math. 17 (2004)
Edoardo Amaldi, Antonio Capone, Matteo Cesana, Federico Malucelli
Optimizing WLAN radio coverage. ICC (2004)
Edoardo Amaldi, Antonio Capone, Federico Malucelli, Francesco Signori
Optimization models and algorithms for downlink UMTS radio planning. WCNC (2003)
Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.
On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. Math. Program. 95 (3) (2003)
Edoardo Amaldi, Antonio Capone, Federico Malucelli
Planning UMTS base station location: optimization models with power control and algorithms. IEEE Trans. Wirel. Commun. 2 (5) (2003)
Edoardo Amaldi, Antonio Capone, Federico Malucelli
Discrete models and algorithms for packet scheduling in smart antennas. Electron. Notes Discret. Math. 13 (2003)
Edoardo Amaldi, Antonio Capone, Federico Malucelli, Francesco Signori
Radio Planning and Optimization of W-CDMA Systems. PWC (2003)
Giulia Galbiati, Edoardo Amaldi
On the Approximability of the Minimum Fundamental Cycle Basis Problem. WAOA (2003)
Edoardo Amaldi, Antonio Capone, Federico Malucelli
Optimizing UMTS radio coverage via base station configuration. PIMRC (2002)
Edoardo Amaldi, Marco Mattavelli
The MIN PFS problem and piecewise linear model estimation. Discret. Appl. Math. 118 (1-2) (2002)
Edoardo Amaldi, Antonio Capone, Federico Malucelli
Improved models and algorithms for UMTS radio planning. VTC Fall (2001)
Edoardo Amaldi, Antonio Capone, Federico Malucelli
Discrete models and algorithms for the capacitated location problems arising in UMTS network planning. DIAL-M (2001)
Marco Mattavelli, Vincent Noel, Edoardo Amaldi
Fast Line Detection Algorithms Based on Combinatorial Optimization. IWVF (2001)
Marco Mattavelli, Vincent Noel, Edoardo Amaldi
A New Approach for Fast Line Detection Based on Combinatorial Optimization. ICIAP (1999)
Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.
Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem. IPCO (1999)
Edoardo Amaldi, Viggo Kann
On the Approximability of Minimizing Nonzero Variables or Unsatisfied Relations in Linear Systems. Theor. Comput. Sci. 209 (1-2) (1998)
Marco Mattavelli, Vincent Noel, Edoardo Amaldi
An Efficient Line Detection Algorithm based on a New Combinatorial Optimization Formulation. ICIP (3) (1998)
Edoardo Amaldi, Bertrand Guenin
Two Constructive Methods for Designing Compact Feedforward Networks of Threshold Units. Int. J. Neural Syst. 8 (5-6) (1997)
Marco Mattavelli, Edoardo Amaldi, Jean-Marc Vesin
A Perceptron-Based Approach to Piecewise Linear Modeling with an Application to Time Series. ICANN (1997)
Edoardo Amaldi, Viggo Kann
On the approximability of some NP-hard minimization problems for linear systems Electron. Colloquium Comput. Complex. 3 (15) (1996)
Marco Mattavelli, Edoardo Amaldi
Estimating piecewise linear models using combinatorial optimization techniques. EUSIPCO (1996)
Edoardo Amaldi, Viggo Kann
The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations. Theor. Comput. Sci. 147 (1&2) (1995)
Edoardo Amaldi, Viggo Kann
On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems. STACS (1994)
Edoardo Amaldi, Eddy Mayoraz, Dominique de Werra
A Review of Combinatorial Problems Arising in Feedforward Neural Network Design. Discret. Appl. Math. 52 (2) (1994)
Roberto Battiti, Edoardo Amaldi, Christof Koch
Computing optical flow across multiple scales: An adaptive coarse-to-fine strategy. Int. J. Comput. Vis. 6 (2) (1991)