Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Edoardo Amaldi
2010 – today
- 2013
[j27]Edoardo Amaldi, Antonio Capone, Luca G. Gianoli: Energy-aware IP traffic engineering with shortest path routing. Computer Networks 57(6): 1503-1517 (2013)- [j26]Edoardo Amaldi, Stefano Coniglio: A distance-based point-reassignment heuristic for the k-hyperplane clustering problem. European Journal of Operational Research 227(1): 22-29 (2013)
- 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, Matteo Cesana, Ilario Filippini: Design of Wireless Sensor Networks for Mobile Target Detection. IEEE/ACM Trans. Netw. 20(3): 784-797 (2012)
- [c35]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, Edoardo Amaldi, Stefano Consonni: Numerical optimization of heat recovery steam cycles: Mathematical model, two-stage algorithm and applications. Computers & Chemical Engineering 35(12): 2799-2823 (2011)
- [j22]Giulia Galbiati, Romeo Rizzi, Edoardo Amaldi: On the approximability of the minimum strictly fundamental cycle basis problem. Discrete Applied Mathematics 159(4): 187-200 (2011)
- [j21]Edoardo Amaldi, Sandro Bosio, Federico Malucelli, Di Yuan: Solving Nonlinear Covering Problems Arising in WLAN Design. Operations Research 59(1): 173-187 (2011)
- [j20]Bakir Lacevic, Edoardo Amaldi: 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)
- [c34]Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari: Formulations and heuristics for the k-Piecewise Affine Model Fitting problem. CTW 2011: 48-51
- [c33]Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi: On cycle bases with limited edge overlap. CTW 2011: 52-55
- [c32]Edoardo Amaldi, Maurizio Bruglieri, Bernard Fortz: On the Hazmat Transport Network Design Problem. INOC 2011: 327-338
- [c31]Edoardo Amaldi, Antonio Capone, Luca G. Gianoli, Luca Mascetti: A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing. INOC 2011: 464-477
- [c30]Edoardo Amaldi, Antonio Capone, Luca G. Gianoli, Luca Mascetti: Energy management in IP traffic engineering with Shortest Path routing. WOWMOM 2011: 1-6
- 2010
- [c29]Bakir Lacevic, Edoardo Amaldi: On population diversity measures in Euclidean space. IEEE Congress on Evolutionary Computation 2010: 1-8
- [c28]Edoardo Amaldi, Bernard Fortz, Claudio Iuliano: On Finding a Minimum Weight Cycle Basis with Cycles of Bounded Length. CTW 2010: 5-8
- [c27]Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi: Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs. IPCO 2010: 397-410
- [c26]Edoardo Amaldi, Stefano Coniglio, Stefano Gualandi: Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation. SEA 2010: 266-275
2000 – 2009
- 2009
- [j18]Edoardo Amaldi, Leo Liberti, Francesco Maffioli, Nelson Maculan: Edge-swapping algorithms for the minimum fundamental cycle basis problem. Math. Meth. of OR 69(2): 205-233 (2009)
- [c25]Edoardo Amaldi, Stefano Coniglio, Kanika Dhyani: k-Hyperplane Clustering Problem: Column Generation and a Metaheuristic. CTW 2009: 355-358
- [c24]Edoardo Amaldi, Claudio Iuliano, Tomasz Jurkiewicz, Kurt Mehlhorn, Romeo Rizzi: Breaking the O(m2n) Barrier for Minimum Cycle Bases. ESA 2009: 301-312
- [c23]Jonatha Anselmi, Paolo Cremonesi, Edoardo Amaldi: On the Consolidation of Data-Centers with Performance Constraints. QoSA 2009: 163-176
- 2008
- [j17]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)
- [j16]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)
- [j15]Edoardo Amaldi, Antonio Capone, Federico Malucelli: Radio planning and coverage optimization of 3G cellular networks. Wireless Networks 14(4): 435-447 (2008)
- [c22]Edoardo Amaldi, Giulia Galbiati, Francesco Maffioli: On minimum reload cost paths, tours and flows. CTW 2008: 112-115
- [c21]Edoardo Amaldi, Alberto Ceselli, Kanika Dhyani: Column Generation for the Minimum Hyperplanes Clustering Problem. CTW 2008: 162-166
- [c20]Edoardo Amaldi, Antonio Capone, Matteo Cesana, Ilario Filippini: Coverage planning of Wireless Sensors for mobile target detection. MASS 2008: 48-57
- [c19]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, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar: Provisioning virtual private networks under traffic uncertainty. Networks 49(1): 100-115 (2007)
- [c18]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, Antonio Capone, Federico Malucelli: Optimizing base station location and configuration in UMTS networks. Annals OR 146(1): 135-151 (2006)
- 2005
- [j12]Edoardo Amaldi, Raphael Hauser: Boundedness Theorems for the Relaxation Method. Math. Oper. Res. 30(4): 939-955 (2005)
- [c17]Edoardo Amaldi, Pietro Belotti, Raphael Hauser: Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem. IPCO 2005: 249-264
- 2004
- [j11]Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar: Virtual Private Network Design Under Traffic Uncertainty. Electronic Notes in Discrete Mathematics 17: 19-22 (2004)
- [j10]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)
- [c16]Aysegül Altin, Edoardo Amaldi, Pietro Belotti, Mustafa Ç. Pinar: Virtual Private Network Design Under Traffic Uncertainty. CTW 2004: 24-27
- [c15]Edoardo Amaldi, Leo Liberti, Francesco Maffioli: Algorithms for Finding Minimum Fundamental Cycle Bases in Graphs. CTW 2004: 33-36
- [c14]Edoardo Amaldi, Antonio Capone, Matteo Cesana, Luigi Fratta, Federico Malucelli: Algorithms for WLAN Coverage Planning. EuroNGI Workshop 2004: 52-65
- [c13]Edoardo Amaldi, Antonio Capone, Matteo Cesana, Federico Malucelli: Optimizing WLAN radio coverage. ICC 2004: 180-184
- [c12]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
- [c11]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, Federico Malucelli: Discrete models and algorithms for packet scheduling in smart antennas. Electronic Notes in Discrete Mathematics 13: 1-4 (2003)
- [j8]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)
- [j7]Edoardo Amaldi, Antonio Capone, Federico Malucelli: Planning UMTS base station location: optimization models with power control and algorithms. IEEE Transactions on Wireless Communications 2(5): 939-952 (2003)
- [c10]Edoardo Amaldi, Antonio Capone, Federico Malucelli, Francesco Signori: Radio Planning and Optimization of W-CDMA Systems. PWC 2003: 437-447
- [c9]Giulia Galbiati, Edoardo Amaldi: On the Approximability of the Minimum Fundamental Cycle Basis Problem. WAOA 2003: 151-164
- [c8]Edoardo Amaldi, Antonio Capone, Federico Malucelli, Francesco Signori: 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. Discrete Applied Mathematics 118(1-2): 115-143 (2002)
- 2001
- [c7]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
- [c6]Marco Mattavelli, Vincent Noel, Edoardo Amaldi: Fast Line Detection Algorithms Based on Combinatorial Optimization. IWVF 2001: 410-419
1990 – 1999
- 1999
- [c5]Marco Mattavelli, Vincent Noel, Edoardo Amaldi: A New Approach for Fast Line Detection Based on Combinatorial Optimization. ICIAP 1999: 168-173
- [c4]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
- [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)
- [c3]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)
- [c2]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
- [i1]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
- [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. Discrete Applied Mathematics 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, 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)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-17 21:54 CEST by the dblp team