default search action
Edoardo Amaldi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
- [j40]Edoardo Amaldi
, Antonio Consolo, Andrea Manno
On multivariate randomized classification trees: l0-based sparsity, VC dimension and decomposition methods. Comput. Oper. Res. 151: 106058 (2023) - [j39]Federica Filippini
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): 1630-1646 (2023) - 2021
- [c48]Federica Filippini
ANDREAS: Artificial intelligence traiNing scheDuler foR accElerAted resource clusterS. FiCloud 2021: 388-393 - [i3]Federica Filippini, Danilo Ardagna, Marco Lattuada
ANDREAS: Artificial intelligence traiNing scheDuler foR accElerAted resource clusterS. CoRR abs/2105.05080 (2021) - [i2]Edoardo Amaldi, Antonio Consolo, Andrea Manno:
On multivariate randomized classification trees: l0-based sparsity, VC dimension and decomposition methods. CoRR abs/2112.05239 (2021) - 2020
- [j38]Stefano Coniglio
Elastic Traffic Engineering Subject to a Fair Bandwidth Allocation via Bilevel Programming. IEEE/ACM Trans. Netw. 28(6): 2407-2420 (2020) - [c47]Federica Filippini
Hierarchical Scheduling in on-demand GPU-as-a-Service Systems. SYNASC 2020: 125-132
2010 – 2019
- 2019
- [c46]Arezoo Jahani, Marco Lattuada
Optimizing on-demand GPUs in the Cloud for Deep Learning Applications Training. ICCCS 2019: 1-8 - 2016
- [j37]Edoardo Amaldi, Stefano Coniglio
Discrete optimization methods to fit piecewise affine models to data points. Comput. Oper. Res. 75: 214-230 (2016) - [j36]Edoardo Amaldi, Stefano Coniglio
On the computational complexity of the virtual network embedding problem. Electron. Notes Discret. Math. 52: 213-220 (2016) - [j35]Jean Respen, Nicolas Zufferey, Edoardo Amaldi:
Metaheuristics for a job scheduling problem with smoothing costs relevant for the car industry. Networks 67(3): 246-261 (2016) - 2014
- [j34]Emanuele Martelli
PGS-COM: A hybrid method for constrained non-smooth black-box optimization problems: Brief review, novel algorithm and comparative evaluation. Comput. Chem. Eng. 63: 108-139 (2014) - [j33]Edoardo Amaldi, Stefano Coniglio
Coordinated cutting plane generation via multi-objective separation. Math. Program. 143(1-2): 87-110 (2014) - [c45]Edoardo Amaldi, Stefano Coniglio
Maximum Throughput Network Routing Subject to Fair Flow Allocation. ISCO 2014: 1-12 - 2013
- [j32]Edoardo Amaldi, Antonio Capone
Energy-aware IP traffic engineering with shortest path routing. Comput. Networks 57(6): 1503-1517 (2013) - [j31]Edoardo Amaldi, Kanika Dhyani, Leo Liberti
A two-phase heuristic for the bottleneck k-hyperplane clustering problem. Comput. Optim. Appl. 56(3): 619-633 (2013) - [j30]Edoardo Amaldi, Stefano Coniglio
On single-path network routing subject to max-min fair flow allocation. Electron. Notes Discret. Math. 41: 543-550 (2013) - [j29]Edoardo Amaldi, Stefano Coniglio
A distance-based point-reassignment heuristic for the k-hyperplane clustering problem. Eur. J. Oper. Res. 227(1): 22-29 (2013) - [j28]Edoardo Amaldi, Antonio Capone
Network Optimization Problems Subject to Max-Min Fair Flow Allocation. IEEE Commun. Lett. 17(7): 1463-1466 (2013) - [j27]Edoardo Amaldi, Kanika Dhyani, Alberto Ceselli
Column Generation for the Minimum Hyperplanes Clustering Problem. INFORMS J. Comput. 25(3): 446-460 (2013) - [j26]Edoardo Amaldi, Federico Malucelli:
In memoriam of Francesco Maffioli (1941-2012). Int. Trans. Oper. Res. 20(3): 435-439 (2013) - [c44]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: 1796-1800 - [c43]Edoardo Amaldi, Antonio Capone
Energy-aware traffic engineering with elastic demands and MMF bandwidth allocation. CAMAD 2013: 169-174 - [c42]Giulio Betti, Edoardo Amaldi, Antonio Capone
Cost-aware optimization models for communication networks with renewable energy sources. INFOCOM Workshops 2013: 25-30 - [c41]Giulio Betti, Edoardo Amaldi, Antonio Capone
Cost-aware optimization models for communication networks with renewable energy sources. INFOCOM 2013: 3231-3236 - [c40]Alessandro Redondi
Optimizing the placement of anchor nodes in RSS-based indoor localization systems. Med-Hoc-Net 2013: 8-13 - [c39]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: 177-182 - 2012
- [j25]Edoardo Amaldi, Sandro Bosio, Federico Malucelli
Hyperbolic set covering problems with competing ground-set elements. Math. Program. 134(2): 323-348 (2012) - [j24]Edoardo Amaldi, Antonio Capone
Design of Wireless Sensor Networks for Mobile Target Detection. IEEE/ACM Trans. Netw. 20(3): 784-797 (2012) - [c38]Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari:
k-Piecewise Affine Model Fitting: Heuristics Based on Multiway Linear Classification. CTW 2012: 16-19 - 2011
- [j23]Emanuele Martelli
Numerical optimization of heat recovery steam cycles: Mathematical model, two-stage algorithm and applications. Comput. Chem. Eng. 35(12): 2799-2823 (2011) - [j22]Giulia Galbiati, Romeo Rizzi
On the approximability of the minimum strictly fundamental cycle basis problem. Discret. Appl. Math. 159(4): 187-200 (2011) - [j21]Edoardo Amaldi, Sandro Bosio, Federico Malucelli
Solving Nonlinear Covering Problems Arising in WLAN Design. Oper. Res. 59(1): 173-187 (2011) - [j20]Bakir Lacevic
Ectropy of diversity measures for populations in Euclidean space. Inf. Sci. 181(11): 2316-2339 (2011) - [j19]Edoardo Amaldi, Giulia Galbiati, Francesco Maffioli:
On minimum reload cost paths, tours, and flows. Networks 57(3): 254-260 (2011) - [c37]Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari:
Formulations and heuristics for the k-Piecewise Affine Model Fitting problem. CTW 2011: 48-51 - [c36]Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi:
On cycle bases with limited edge overlap. CTW 2011: 52-55 - [c35]Edoardo Amaldi, Maurizio Bruglieri, Bernard Fortz
On the Hazmat Transport Network Design Problem. INOC 2011: 327-338 - [c34]Edoardo Amaldi, Antonio Capone
A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing. INOC 2011: 464-477 - [c33]Edoardo Amaldi, Antonio Capone
Energy management in IP traffic engineering with Shortest Path routing. WOWMOM 2011: 1-6 - 2010
- [c32]Bakir Lacevic
On population diversity measures in Euclidean space. IEEE Congress on Evolutionary Computation 2010: 1-8 - [c31]Edoardo Amaldi, Bernard Fortz, Claudio Iuliano:
On Finding a Minimum Weight Cycle Basis with Cycles of Bounded Length. CTW 2010: 5-8 - [c30]Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi
Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. IPCO 2010: 397-410 - [c29]Edoardo Amaldi, Stefano Coniglio
Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation. SEA 2010: 266-275
2000 – 2009
- 2009
- [j18]Edoardo Amaldi, Leo Liberti
Edge-swapping algorithms for the minimum fundamental cycle basis problem. Math. Methods Oper. Res. 69(2): 205-233 (2009) - [c28]Edoardo Amaldi, Stefano Coniglio, Kanika Dhyani:
k-Hyperplane Clustering Problem: Column Generation and a Metaheuristic. CTW 2009: 355-358 - [c27]Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi
Breaking the O(m2n) Barrier for Minimum Cycle Bases. ESA 2009: 301-312 - [c26]Jonatha Anselmi, Paolo Cremonesi
On the Consolidation of Data-Centers with Performance Constraints. QoSA 2009: 163-176 - 2008
- [j17]Edoardo Amaldi, Antonio Capone
Optimization models and methods for planning wireless mesh networks. Comput. Networks 52(11): 2159-2171 (2008) - [j16]Edoardo Amaldi, Maurizio Bruglieri, Giuliano Casale
A two-phase relaxation-based heuristic for the maximum feasible subsystem problem. Comput. Oper. Res. 35(5): 1465-1482 (2008) - [j15]Edoardo Amaldi, Antonio Capone
Radio planning and coverage optimization of 3G cellular networks. Wirel. Networks 14(4): 435-447 (2008) - [c25]Edoardo Amaldi, Giulia Galbiati, Francesco Maffioli:
On minimum reload cost paths, tours and flows. CTW 2008: 112-115 - [c24]Edoardo Amaldi, Alberto Ceselli, Kanika Dhyani:
Column Generation for the Minimum Hyperplanes Clustering Problem. CTW 2008: 162-166 - [c23]Edoardo Amaldi, Antonio Capone
Coverage planning of Wireless Sensors for mobile target detection. MASS 2008: 48-57 - [c22]Jonatha Anselmi, Edoardo Amaldi, Paolo Cremonesi
Service Consolidation with End-to-End Response Time Constraints. EUROMICRO-SEAA 2008: 345-352 - 2007
- [j14]Aysegül Altin
Provisioning virtual private networks under traffic uncertainty. Networks 49(1): 100-115 (2007) - [c21]Edoardo Amaldi, Antonio Capone, Matteo Cesana, Federico Malucelli:
Optimization Models for the Radio Planning of Wireless Mesh Networks. Networking 2007: 287-298 - 2006
- [j13]Edoardo Amaldi, Pietro Belotti
Optimizing base station location and configuration in UMTS networks. Ann. Oper. Res. 146(1): 135-151 (2006) - [p1]Edoardo Amaldi, Antonio Capone, Federico Malucelli, Carlo Mannino:
Optimization Problems and Models for Planning Cellular Networks. Handbook of Optimization in Telecommunications 2006: 917-939 - 2005
- [j12]Edoardo Amaldi, Raphael Hauser
Boundedness Theorems for the Relaxation Method. Math. Oper. Res. 30(4): 939-955 (2005) - [c20]Edoardo Amaldi, Pietro Belotti
Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem. IPCO 2005: 249-264 - 2004
- [j11]Aysegül Altin
Virtual Private Network Design Under Traffic Uncertainty. Electron. Notes Discret. Math. 17: 19-22 (2004) - [j10]Edoardo Amaldi, Leo Liberti
Algorithms for finding minimum fundamental cycle bases in graphs. Electron. Notes Discret. Math. 17: 29-33 (2004) - [c19]Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar:
Virtual Private Network Design Under Traffic Uncertainty. CTW 2004: 24-27 - [c18]Edoardo Amaldi, Leo Liberti, Francesco Maffioli:
Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs. CTW 2004: 33-36 - [c17]Edoardo Amaldi, Antonio Capone, Matteo Cesana, Luigi Fratta, Federico Malucelli:
Algorithms for WLAN Coverage Planning. EuroNGI Workshop 2004: 52-65 - [c16]Edoardo Amaldi, Antonio Capone, Matteo Cesana, Federico Malucelli:
Optimizing WLAN radio coverage. ICC 2004: 180-184 - [c15]Edoardo Amaldi, Antonio Capone, Federico Malucelli, Gianluca Villa:
Optimization of packet scheduling in wireless systems with smart antennas: geometric models and algorithms. ICC 2004: 4238-4242 - [c14]Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli:
Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases. WEA 2004: 14-29 - 2003
- [j9]Edoardo Amaldi, Antonio Capone
Discrete models and algorithms for packet scheduling in smart antennas. Electron. Notes Discret. Math. 13: 1-4 (2003) - [j8]Edoardo Amaldi, Marc E. Pfetsch
On the maximum feasible subsystem problem, IISs and IIS-hypergraphs. Math. Program. 95(3): 533-554 (2003) - [j7]Edoardo Amaldi, Antonio Capone
Planning UMTS base station location: optimization models with power control and algorithms. IEEE Trans. Wirel. Commun. 2(5): 939-952 (2003) - [c13]Edoardo Amaldi, Antonio Capone, Federico Malucelli, Francesco Signori:
Radio Planning and Optimization of W-CDMA Systems. PWC 2003: 437-447 - [c12]Giulia Galbiati, Edoardo Amaldi:
On the Approximability of the Minimum Fundamental Cycle Basis Problem. WAOA 2003: 151-164 - [c11]Edoardo Amaldi, Antonio Capone
Optimization models and algorithms for downlink UMTS radio planning. WCNC 2003: 827-831 - 2002
- [j6]Edoardo Amaldi, Marco Mattavelli:
The MIN PFS problem and piecewise linear model estimation. Discret. Appl. Math. 118(1-2): 115-143 (2002) - [c10]Edoardo Amaldi, Antonio Capone
Optimizing UMTS radio coverage via base station configuration. PIMRC 2002: 315-319 - 2001
- [c9]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 - [c8]Marco Mattavelli, Vincent Noel, Edoardo Amaldi:
Fast Line Detection Algorithms Based on Combinatorial Optimization. IWVF 2001: 410-419 - [c7]Edoardo Amaldi, Antonio Capone, Federico Malucelli:
Improved models and algorithms for UMTS radio planning. VTC Fall 2001: 920-924
1990 – 1999
- 1999
- [c6]Marco Mattavelli, Vincent Noel, Edoardo Amaldi:
A New Approach for Fast Line Detection Based on Combinatorial Optimization. ICIAP 1999: 168-173 - [c5]Edoardo Amaldi, Marc E. Pfetsch
Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem. IPCO 1999: 45-59 - 1998
- [j5]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) - [c4]Marco Mattavelli, Vincent Noel, Edoardo Amaldi:
An Efficient Line Detection Algorithm based on a New Combinatorial Optimization Formulation. ICIP (3) 1998: 65-69 - 1997
- [j4]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) - [c3]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 - 1996
- [c2]Marco Mattavelli, Edoardo Amaldi:
Estimating piecewise linear models using combinatorial optimization techniques. EUSIPCO 1996: 1-4 - [i1]Edoardo Amaldi, Viggo Kann:
On the approximability of some NP-hard minimization problems for linear systems. Electron. Colloquium Comput. Complex. TR96 (1996) - 1995
- [j3]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
- [j2]Edoardo Amaldi, Eddy Mayoraz, Dominique de Werra:
A Review of Combinatorial Problems Arising in Feedforward Neural Network Design. Discret. Appl. Math. 52(2): 111-138 (1994) - [c1]Edoardo Amaldi, Viggo Kann:
On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems. STACS 1994: 521-532 - 1991
- [j1]Roberto Battiti
Computing optical flow across multiple scales: An adaptive coarse-to-fine strategy. Int. J. Comput. Vis. 6(2): 133-145 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: