Computing optical flow across multiple scales: An adaptive coarse-to-fine strategy. - Roberto Battiti; Edoardo Amaldi; Christof Koch (Int. J. Comput. Vis., 1991)

On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems. - Edoardo Amaldi; Viggo Kann (STACS, 1994)

A Review of Combinatorial Problems Arising in Feedforward Neural Network Design. - Edoardo Amaldi; Eddy Mayoraz; Dominique de Werra (Discret. Appl. Math., 1994)

The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations. - Edoardo Amaldi; Viggo Kann (Theor. Comput. Sci., 1995)

Estimating piecewise linear models using combinatorial optimization techniques. - Marco Mattavelli; Edoardo Amaldi (EUSIPCO, 1996)

On the approximability of some NP-hard minimization problems for linear systems - Edoardo Amaldi; Viggo Kann (Electron. Colloquium Comput. Complex., 1996)

A Perceptron-Based Approach to Piecewise Linear Modeling with an Application to Time Series. - Marco Mattavelli; Edoardo Amaldi; Jean-Marc Vesin (ICANN, 1997)

Two Constructive Methods for Designing Compact Feedforward Networks of Threshold Units. - Edoardo Amaldi; Bertrand Guenin (Int. J. Neural Syst., 1997)

An Efficient Line Detection Algorithm based on a New Combinatorial Optimization Formulation. - Marco Mattavelli; Vincent Noel; Edoardo Amaldi (ICIP (3), 1998)

On the Approximability of Minimizing Nonzero Variables or Unsatisfied Relations in Linear Systems. - Edoardo Amaldi; Viggo Kann (Theor. Comput. Sci., 1998)

A New Approach for Fast Line Detection Based on Combinatorial Optimization. - Marco Mattavelli; Vincent Noel; Edoardo Amaldi (ICIAP, 1999)

Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem. - Edoardo Amaldi; Marc E. Pfetsch; Leslie E. Trotter Jr. (IPCO, 1999)

Discrete models and algorithms for the capacitated location problems arising in UMTS network planning. - Edoardo Amaldi; Antonio Capone; Federico Malucelli (DIAL-M, 2001)

Fast Line Detection Algorithms Based on Combinatorial Optimization. - Marco Mattavelli; Vincent Noel; Edoardo Amaldi (IWVF, 2001)

Improved models and algorithms for UMTS radio planning. - Edoardo Amaldi; Antonio Capone; Federico Malucelli (VTC Fall, 2001)

Optimizing UMTS radio coverage via base station configuration. - Edoardo Amaldi; Antonio Capone; Federico Malucelli (PIMRC, 2002)

The MIN PFS problem and piecewise linear model estimation. - Edoardo Amaldi; Marco Mattavelli (Discret. Appl. Math., 2002)

Radio Planning and Optimization of W-CDMA Systems. - Edoardo Amaldi; Antonio Capone; Federico Malucelli; Francesco Signori (PWC, 2003)

On the Approximability of the Minimum Fundamental Cycle Basis Problem. - Giulia Galbiati; Edoardo Amaldi (WAOA, 2003)

Optimization models and algorithms for downlink UMTS radio planning. - Edoardo Amaldi; Antonio Capone; Federico Malucelli; Francesco Signori (WCNC, 2003)

Discrete models and algorithms for packet scheduling in smart antennas. - Edoardo Amaldi; Antonio Capone; Federico Malucelli (Electron. Notes Discret. Math., 2003)

On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. - Edoardo Amaldi; Marc E. Pfetsch; Leslie E. Trotter Jr. (Math. Program., 2003)

Planning UMTS base station location: optimization models with power control and algorithms. - Edoardo Amaldi; Antonio Capone; Federico Malucelli (IEEE Trans. Wirel. Commun., 2003)

Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs. - Edoardo Amaldi; Leo Liberti; Francesco Maffioli (CTW, 2004)

Algorithms for WLAN Coverage Planning. - Edoardo Amaldi; Antonio Capone; Matteo Cesana; Luigi Fratta; Federico Malucelli (EuroNGI Workshop, 2004)

Optimizing WLAN radio coverage. - Edoardo Amaldi; Antonio Capone; Matteo Cesana; Federico Malucelli (ICC, 2004)

Optimization of packet scheduling in wireless systems with smart antennas: geometric models and algorithms. - Edoardo Amaldi; Antonio Capone; Federico Malucelli; Gianluca Villa (ICC, 2004)

Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. - Edoardo Amaldi; Leo Liberti; Nelson Maculan; Francesco Maffioli (WEA, 2004)

Virtual Private Network Design Under Traffic Uncertainty. - Aysegül Altin; Edoardo Amaldi; Pietro Belotti; Mustafa Ç. Pinar (Electron. Notes Discret. Math., 2004)

Algorithms for finding minimum fundamental cycle bases in graphs. - Edoardo Amaldi; Leo Liberti; Francesco Maffioli; Nelson Maculan (Electron. Notes Discret. Math., 2004)

Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem. - Edoardo Amaldi; Pietro Belotti; Raphael Hauser (IPCO, 2005)

Boundedness Theorems for the Relaxation Method. - Edoardo Amaldi; Raphael Hauser (Math. Oper. Res., 2005)

Optimization Problems and Models for Planning Cellular Networks. - Edoardo Amaldi; Antonio Capone; Federico Malucelli; Carlo Mannino (Handbook of Optimization in Telecommunications, 2006)

Optimizing base station location and configuration in UMTS networks. - Edoardo Amaldi; Pietro Belotti; Antonio Capone; Federico Malucelli (Ann. Oper. Res., 2006)

Optimization Models for the Radio Planning of Wireless Mesh Networks. - Edoardo Amaldi; Antonio Capone; Matteo Cesana; Federico Malucelli (Networking, 2007)

Provisioning virtual private networks under traffic uncertainty. - Aysegül Altin; Edoardo Amaldi; Pietro Belotti; Mustafa Ç. Pinar (Networks, 2007)

Coverage planning of Wireless Sensors for mobile target detection. - Edoardo Amaldi; Antonio Capone; Matteo Cesana; Ilario Filippini (MASS, 2008)

Service Consolidation with End-to-End Response Time Constraints. - Jonatha Anselmi; Edoardo Amaldi; Paolo Cremonesi (EUROMICRO-SEAA, 2008)

Optimization models and methods for planning wireless mesh networks. - Edoardo Amaldi; Antonio Capone; Matteo Cesana; Ilario Filippini; Federico Malucelli (Comput. Networks, 2008)

A two-phase relaxation-based heuristic for the maximum feasible subsystem problem. - Edoardo Amaldi; Maurizio Bruglieri; Giuliano Casale (Comput. Oper. Res., 2008)

Radio planning and coverage optimization of 3G cellular networks. - Edoardo Amaldi; Antonio Capone; Federico Malucelli (Wirel. Networks, 2008)

k-Hyperplane Clustering Problem: Column Generation and a Metaheuristic. - Edoardo Amaldi; Stefano Coniglio; Kanika Dhyani (CTW, 2009)

Breaking the O(m2n) Barrier for Minimum Cycle Bases. - Edoardo Amaldi; Claudio Iuliano; Tomasz Jurkiewicz; Kurt Mehlhorn; Romeo Rizzi (ESA, 2009)

On the Consolidation of Data-Centers with Performance Constraints. - Jonatha Anselmi; Paolo Cremonesi; Edoardo Amaldi (QoSA, 2009)

Edge-swapping algorithms for the minimum fundamental cycle basis problem. - Edoardo Amaldi; Leo Liberti; Francesco Maffioli; Nelson Maculan (Math. Methods Oper. Res., 2009)

On population diversity measures in Euclidean space. - Bakir Lacevic; Edoardo Amaldi (IEEE Congress on Evolutionary Computation, 2010)

On Finding a Minimum Weight Cycle Basis with Cycles of Bounded Length. - Edoardo Amaldi; Bernard Fortz; Claudio Iuliano (CTW, 2010)

Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. - Edoardo Amaldi; Claudio Iuliano; Romeo Rizzi (IPCO, 2010)

Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation. - Edoardo Amaldi; Stefano Coniglio; Stefano Gualandi (SEA, 2010)

Formulations and heuristics for the k-Piecewise Affine Model Fitting problem. - Edoardo Amaldi; Stefano Coniglio; Leonardo Taccari (CTW, 2011)

On cycle bases with limited edge overlap. - Edoardo Amaldi; Claudio Iuliano; Romeo Rizzi (CTW, 2011)

On the Hazmat Transport Network Design Problem. - Edoardo Amaldi; Maurizio Bruglieri; Bernard Fortz (INOC, 2011)

A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing. - Edoardo Amaldi; Antonio Capone; Luca Giovanni Gianoli; Luca Mascetti (INOC, 2011)

Energy management in IP traffic engineering with Shortest Path routing. - Edoardo Amaldi; Antonio Capone; Luca Giovanni Gianoli; Luca Mascetti (WOWMOM, 2011)

Numerical optimization of heat recovery steam cycles: Mathematical model, two-stage algorithm and applications. - Emanuele Martelli; Edoardo Amaldi; Stefano Consonni (Comput. Chem. Eng., 2011)

On the approximability of the minimum strictly fundamental cycle basis problem. - Giulia Galbiati; Romeo Rizzi; Edoardo Amaldi (Discret. Appl. Math., 2011)

Solving Nonlinear Covering Problems Arising in WLAN Design. - Edoardo Amaldi; Sandro Bosio; Federico Malucelli; Di Yuan 001 (Oper. Res., 2011)

Ectropy of diversity measures for populations in Euclidean space. - Bakir Lacevic; Edoardo Amaldi (Inf. Sci., 2011)

On minimum reload cost paths, tours, and flows. - Edoardo Amaldi; Giulia Galbiati; Francesco Maffioli (Networks, 2011)

k-Piecewise Affine Model Fitting: Heuristics Based on Multiway Linear Classification. - Edoardo Amaldi; Stefano Coniglio; Leonardo Taccari (CTW, 2012)

Hyperbolic set covering problems with competing ground-set elements. - Edoardo Amaldi; Sandro Bosio; Federico Malucelli (Math. Program., 2012)

Design of Wireless Sensor Networks for Mobile Target Detection. - Edoardo Amaldi; Antonio Capone; Matteo Cesana; Ilario Filippini (IEEE/ACM Trans. Netw., 2012)

Multi-clock domain optimization for reconfigurable architectures in high-level dataflow applications. - Simone Casale Brunet; Endri Bezati; Claudio Alberti; Marco Mattavelli; Edoardo Amaldi; Jörn W. Janneck (ACSSC, 2013)

Energy-aware traffic engineering with elastic demands and MMF bandwidth allocation. - Edoardo Amaldi; Antonio Capone; Stefano Coniglio; Luca Giovanni Gianoli (CAMAD, 2013)

Cost-aware optimization models for communication networks with renewable energy sources. - Giulio Betti; Edoardo Amaldi; Antonio Capone; Giulia Ercolani (INFOCOM, 2013)

Optimizing the placement of anchor nodes in RSS-based indoor localization systems. - Alessandro Redondi; Edoardo Amaldi (Med-Hoc-Net, 2013)

Partitioning and optimization of high level stream applications for multi clock domain architectures. - Simone Casale Brunet; Endri Bezati; Claudio Alberti; Marco Mattavelli; Edoardo Amaldi; Jörn W. Janneck (SiPS, 2013)

Energy-aware IP traffic engineering with shortest path routing. - Edoardo Amaldi; Antonio Capone; Luca Giovanni Gianoli (Comput. Networks, 2013)

A two-phase heuristic for the bottleneck k-hyperplane clustering problem. - Edoardo Amaldi; Kanika Dhyani; Leo Liberti (Comput. Optim. Appl., 2013)

On single-path network routing subject to max-min fair flow allocation. - Edoardo Amaldi; Stefano Coniglio; Luca Giovanni Gianoli; Can Umut Ileri (Electron. Notes Discret. Math., 2013)

A distance-based point-reassignment heuristic for the k-hyperplane clustering problem. - Edoardo Amaldi; Stefano Coniglio (Eur. J. Oper. Res., 2013)

Network Optimization Problems Subject to Max-Min Fair Flow Allocation. - Edoardo Amaldi; Antonio Capone; Stefano Coniglio; Luca Giovanni Gianoli (IEEE Commun. Lett., 2013)

Column Generation for the Minimum Hyperplanes Clustering Problem. - Edoardo Amaldi; Kanika Dhyani; Alberto Ceselli (INFORMS J. Comput., 2013)

In memoriam of Francesco Maffioli (1941-2012). - Edoardo Amaldi; Federico Malucelli (Int. Trans. Oper. Res., 2013)

Maximum Throughput Network Routing Subject to Fair Flow Allocation. - Edoardo Amaldi; Stefano Coniglio; Leonardo Taccari (ISCO, 2014)

PGS-COM: A hybrid method for constrained non-smooth black-box optimization problems: Brief review, novel algorithm and comparative evaluation. - Emanuele Martelli; Edoardo Amaldi (Comput. Chem. Eng., 2014)

Coordinated cutting plane generation via multi-objective separation. - Edoardo Amaldi; Stefano Coniglio; Stefano Gualandi (Math. Program., 2014)

Discrete optimization methods to fit piecewise affine models to data points. - Edoardo Amaldi; Stefano Coniglio; Leonardo Taccari (Comput. Oper. Res., 2016)

On the computational complexity of the virtual network embedding problem. - Edoardo Amaldi; Stefano Coniglio; Arie M. C. A. Koster; Martin Tieves (Electron. Notes Discret. Math., 2016)

Metaheuristics for a job scheduling problem with smoothing costs relevant for the car industry. - Jean Respen; Nicolas Zufferey; Edoardo Amaldi (Networks, 2016)

Optimizing on-demand GPUs in the Cloud for Deep Learning Applications Training. - Arezoo Jahani; Marco Lattuada 001; Michele Ciavotta; Danilo Ardagna; Edoardo Amaldi; Li Zhang 002 (ICCCS, 2019)

Hierarchical Scheduling in on-demand GPU-as-a-Service Systems. - Federica Filippini; Marco Lattuada 001; Arezoo Jahani; Michele Ciavotta; Danilo Ardagna; Edoardo Amaldi (SYNASC, 2020)

Elastic Traffic Engineering Subject to a Fair Bandwidth Allocation via Bilevel Programming. - Stefano Coniglio; Luca Giovanni Gianoli; Edoardo Amaldi; Antonio Capone (IEEE/ACM Trans. Netw., 2020)

ANDREAS: Artificial intelligence traiNing scheDuler foR accElerAted resource clusterS. - Federica Filippini; Danilo Ardagna; Marco Lattuada 001; Edoardo Amaldi; Maciek Riedl; Katarzyna Materka; Pawel Skrzypek; Michele Ciavotta; Fabrizio Magugliani; Marco Cicala (FiCloud, 2021)

On multivariate randomized classification trees: l0-based sparsity, VC dimension and decomposition methods. - Edoardo Amaldi; Antonio Consolo; Andrea Manno (CoRR, 2021)

On multivariate randomized classification trees: l0-based sparsity, VC dimension and decomposition methods. - Edoardo Amaldi; Antonio Consolo; Andrea Manno (Comput. Oper. Res., 2023)

A Path Relinking Method for the Joint Online Scheduling and Capacity Allocation of DL Training Workloads in GPU as a Service Systems. - Federica Filippini; Marco Lattuada 001; Michele Ciavotta; Arezoo Jahani; Danilo Ardagna; Edoardo Amaldi (IEEE Trans. Serv. Comput., 2023)

Soft regression trees: a model variant and a decomposition training algorithm. - Antonio Consolo; Edoardo Amaldi; Andrea Manno (CoRR, 2025)

Soft decision trees for survival analysis. - Antonio Consolo; Edoardo Amaldi; Emilio Carrizosa (CoRR, 2025)