Edoardo Amaldi

According to our database1, Edoardo Amaldi authored at least 81 papers between 1991 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2019
Optimizing on-demand GPUs in the Cloud for Deep Learning Applications Training.
Proceedings of the 2019 4th International Conference on Computing, 2019

2016
Metaheuristics for a job scheduling problem with smoothing costs relevant for the car industry.
Networks, 2016

On the computational complexity of the virtual network embedding problem.
Electron. Notes Discret. Math., 2016

Discrete optimization methods to fit piecewise affine models to data points.
Comput. Oper. Res., 2016

2014
Coordinated cutting plane generation via multi-objective separation.
Math. Program., 2014

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

Maximum Throughput Network Routing Subject to Fair Flow Allocation.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

2013
In memoriam of Francesco Maffioli (1941-2012).
Int. Trans. Oper. Res., 2013

Column Generation for the Minimum Hyperplanes Clustering Problem.
INFORMS J. Comput., 2013

Network Optimization Problems Subject to Max-Min Fair Flow Allocation.
IEEE Commun. Lett., 2013

A distance-based point-reassignment heuristic for the k-hyperplane clustering problem.
Eur. J. Oper. Res., 2013

On single-path network routing subject to max-min fair flow allocation.
Electron. Notes Discret. Math., 2013

A two-phase heuristic for the bottleneck <i>k</i>-hyperplane clustering problem.
Comput. Optim. Appl., 2013

Energy-aware IP traffic engineering with shortest path routing.
Comput. Networks, 2013

Partitioning and optimization of high level stream applications for multi clock domain architectures.
Proceedings of the IEEE Workshop on Signal Processing Systems, 2013

Optimizing the placement of anchor nodes in RSS-based indoor localization systems.
Proceedings of the 12th Annual Mediterranean Ad Hoc Networking Workshop, 2013

Cost-aware optimization models for communication networks with renewable energy sources.
Proceedings of the 2013 Proceedings IEEE INFOCOM Workshops, 2013

Energy-aware traffic engineering with elastic demands and MMF bandwidth allocation.
Proceedings of the IEEE 18th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks, 2013

Multi-clock domain optimization for reconfigurable architectures in high-level dataflow applications.
Proceedings of the 2013 Asilomar Conference on Signals, 2013

2012
Design of Wireless Sensor Networks for Mobile Target Detection.
IEEE/ACM Trans. Netw., 2012

Hyperbolic set covering problems with competing ground-set elements.
Math. Program., 2012

k-Piecewise Affine Model Fitting: Heuristics Based on Multiway Linear Classification.
Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011
On minimum reload cost paths, tours, and flows.
Networks, 2011

Ectropy of diversity measures for populations in Euclidean space.
Inf. Sci., 2011

Solving Nonlinear Covering Problems Arising in WLAN Design.
Oper. Res., 2011

On the approximability of the minimum strictly fundamental cycle basis problem.
Discret. Appl. Math., 2011

Numerical optimization of heat recovery steam cycles: Mathematical model, two-stage algorithm and applications.
Comput. Chem. Eng., 2011

Energy management in IP traffic engineering with Shortest Path routing.
Proceedings of the 12th IEEE International Symposium on a World of Wireless, 2011

A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing.
Proceedings of the Network Optimization - 5th International Conference, 2011

On the Hazmat Transport Network Design Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

On cycle bases with limited edge overlap.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Formulations and heuristics for the k-Piecewise Affine Model Fitting problem.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2010
Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs.
Proceedings of the Integer Programming and Combinatorial Optimization, 2010

On Finding a Minimum Weight Cycle Basis with Cycles of Bounded Length.
Proceedings of the 9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2010

On population diversity measures in Euclidean space.
Proceedings of the IEEE Congress on Evolutionary Computation, 2010

2009
Edge-swapping algorithms for the minimum fundamental cycle basis problem.
Math. Methods Oper. Res., 2009

On the Consolidation of Data-Centers with Performance Constraints.
Proceedings of the Architectures for Adaptive Software Systems, 2009

Breaking the O(m<sup>2</sup>n) Barrier for Minimum Cycle Bases.
Proceedings of the Algorithms, 2009

k-Hyperplane Clustering Problem: Column Generation and a Metaheuristic.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Radio planning and coverage optimization of 3G cellular networks.
Wirel. Networks, 2008

A two-phase relaxation-based heuristic for the maximum feasible subsystem problem.
Comput. Oper. Res., 2008

Optimization models and methods for planning wireless mesh networks.
Comput. Networks, 2008

Service Consolidation with End-to-End Response Time Constraints.
Proceedings of the 34th Euromicro Conference on Software Engineering and Advanced Applications, 2008

Coverage planning of Wireless Sensors for mobile target detection.
Proceedings of the IEEE 5th International Conference on Mobile Adhoc and Sensor Systems, 2008

2007
Provisioning virtual private networks under traffic uncertainty.
Networks, 2007

Optimization Models for the Radio Planning of Wireless Mesh Networks.
Proceedings of the NETWORKING 2007. Ad Hoc and Sensor Networks, 2007

2006
Optimizing base station location and configuration in UMTS networks.
Ann. Oper. Res., 2006

Optimization Problems and Models for Planning Cellular Networks.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

2005
Boundedness Theorems for the Relaxation Method.
Math. Oper. Res., 2005

Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

2004
Algorithms for finding minimum fundamental cycle bases in graphs.
Electron. Notes Discret. Math., 2004

Virtual Private Network Design Under Traffic Uncertainty.
Electron. Notes Discret. Math., 2004

Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

Optimization of packet scheduling in wireless systems with smart antennas: geometric models and algorithms.
Proceedings of IEEE International Conference on Communications, 2004

Optimizing WLAN radio coverage.
Proceedings of IEEE International Conference on Communications, 2004

Algorithms for WLAN Coverage Planning.
Proceedings of the Wireless Systems and Mobility in Next Generation Internet, 2004

Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs.
Proceedings of the CTW04 Workshop on Graphs and Combinatorial Optimization, 2004

2003
Planning UMTS base station location: optimization models with power control and algorithms.
IEEE Trans. Wirel. Commun., 2003

On the maximum feasible subsystem problem, IISs and IIS-hypergraphs.
Math. Program., 2003

Discrete models and algorithms for packet scheduling in smart antennas.
Electron. Notes Discret. Math., 2003

Optimization models and algorithms for downlink UMTS radio planning.
Proceedings of the 2003 IEEE Wireless Communications and Networking, 2003

On the Approximability of the Minimum Fundamental Cycle Basis Problem.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

Radio Planning and Optimization of W-CDMA Systems.
Proceedings of the Personal Wireless Communications, IFIP-TC6 8th International Conference, 2003

2002
The MIN PFS problem and piecewise linear model estimation.
Discret. Appl. Math., 2002

Optimizing UMTS radio coverage via base station configuration.
Proceedings of the 13th IEEE International Symposium on Personal, 2002

2001
Improved models and algorithms for UMTS radio planning.
Proceedings of the 54th IEEE Vehicular Technology Conference, 2001

Fast Line Detection Algorithms Based on Combinatorial Optimization.
Proceedings of the Visual Form 2001, 4th International Workshop on Visual Form, 2001

Discrete models and algorithms for the capacitated location problems arising in UMTS network planning.
Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

1999
Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 1999

A New Approach for Fast Line Detection Based on Combinatorial Optimization.
Proceedings of the 1oth International Conference on Image Analysis and Processing (ICIAP 1999), 1999

1998
On the Approximability of Minimizing Nonzero Variables or Unsatisfied Relations in Linear Systems.
Theor. Comput. Sci., 1998

An Efficient Line Detection Algorithm based on a New Combinatorial Optimization Formulation.
Proceedings of the 1998 IEEE International Conference on Image Processing, 1998

1997
Two Constructive Methods for Designing Compact Feedforward Networks of Threshold Units.
Int. J. Neural Syst., 1997

A Perceptron-Based Approach to Piecewise Linear Modeling with an Application to Time Series.
Proceedings of the Artificial Neural Networks, 1997

1996
On the approximability of some NP-hard minimization problems for linear systems
Electron. Colloquium Comput. Complex., 1996

Estimating piecewise linear models using combinatorial optimization techniques.
Proceedings of the 8th European Signal Processing Conference, 1996

1995
The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations.
Theor. Comput. Sci., 1995

1994
A Review of Combinatorial Problems Arising in Feedforward Neural Network Design.
Discret. Appl. Math., 1994

On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems.
Proceedings of the STACS 94, 1994

1991
Computing optical flow across multiple scales: An adaptive coarse-to-fine strategy.
Int. J. Comput. Vis., 1991


  Loading...