The SCEAS System
| |||||||

## Search the dblp DataBase
Edoardo Amaldi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Edoardo Amaldi, Antonio Capone, Federico Malucelli
**Discrete models and algorithms for the capacitated location problems arising in UMTS network planning.**[Citation Graph (0, 0)][DBLP] DIAL-M, 2001, pp:1-8 [Conf] - Edoardo Amaldi, Antonio Capone, Matteo Cesana, Luigi Fratta, Federico Malucelli
**Algorithms for WLAN Coverage Planning.**[Citation Graph (0, 0)][DBLP] EuroNGI Workshop, 2004, pp:52-65 [Conf] - Marco Mattavelli, Edoardo Amaldi, Jean-Marc Vesin
**A Perceptron-Based Approach to Piecewise Linear Modeling with an Application to Time Series.**[Citation Graph (0, 0)][DBLP] ICANN, 1997, pp:547-552 [Conf] - Marco Mattavelli, Vincent Noel, Edoardo Amaldi
**A New Approach for Fast Line Detection Based on Combinatorial Optimization.**[Citation Graph (0, 0)][DBLP] ICIAP, 1999, pp:168-173 [Conf] - Marco Mattavelli, Vincent Noel, Edoardo Amaldi
**An Efficient Line Detection Algorithm based on a New Combinatorial Optimization Formulation.**[Citation Graph (0, 0)][DBLP] ICIP (3), 1998, pp:65-69 [Conf] - Edoardo Amaldi, Antonio Capone, Federico Malucelli, Francesco Signori
**Radio Planning and Optimization of W-CDMA Systems.**[Citation Graph (0, 0)][DBLP] PWC, 2003, pp:437-447 [Conf] - Edoardo Amaldi, Pietro Belotti, Raphael Hauser
**Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem.**[Citation Graph (0, 0)][DBLP] IPCO, 2005, pp:249-264 [Conf] - Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.
**Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem.**[Citation Graph (0, 0)][DBLP] IPCO, 1999, pp:45-59 [Conf] - Marco Mattavelli, Vincent Noel, Edoardo Amaldi
**Fast Line Detection Algorithms Based on Combinatorial Optimization.**[Citation Graph (0, 0)][DBLP] IWVF, 2001, pp:410-419 [Conf] - Edoardo Amaldi, Viggo Kann
**On the Approximability of Finding Maximum Feasible Subsystems of Linear Systems.**[Citation Graph (0, 0)][DBLP] STACS, 1994, pp:521-532 [Conf] - Giulia Galbiati, Edoardo Amaldi
**On the Approximability of the Minimum Fundamental Cycle Basis Problem.**[Citation Graph (0, 0)][DBLP] WAOA, 2003, pp:151-164 [Conf] - Edoardo Amaldi, Leo Liberti, Nelson Maculan, Francesco Maffioli
**Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases.**[Citation Graph (0, 0)][DBLP] WEA, 2004, pp:14-29 [Conf] - Edoardo Amaldi, Marco Mattavelli
**The MIN PFS problem and piecewise linear model estimation.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:118, n:1-2, pp:115-143 [Journal] - Edoardo Amaldi, Eddy Mayoraz, Dominique de Werra
**A Review of Combinatorial Problems Arising in Feedforward Neural Network Design.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1994, v:52, n:2, pp:111-138 [Journal] - Edoardo Amaldi, Bertrand Guenin
**Two Constructive Methods for Designing Compact Feedforward Networks of Threshold Units.**[Citation Graph (0, 0)][DBLP] Int. J. Neural Syst., 1997, v:8, n:5-6, pp:629-645 [Journal] - Edoardo Amaldi, Marc E. Pfetsch, Leslie E. Trotter Jr.
**On the maximum feasible subsystem problem, IISs and IIS-hypergraphs.**[Citation Graph (0, 0)][DBLP] Math. Program., 2003, v:95, n:3, pp:533-554 [Journal] - Edoardo Amaldi, Viggo Kann
**The Complexity and Approximability of Finding Maximum Feasible Subsystems of Linear Relations.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1995, v:147, n:1&2, pp:181-210 [Journal] - Edoardo Amaldi, Viggo Kann
**On the Approximability of Minimizing Nonzero Variables or Unsatisfied Relations in Linear Systems.**[Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:209, n:1-2, pp:237-260 [Journal] **Breaking the O(m**[Citation Graph (, )][DBLP]^{2}n) Barrier for Minimum Cycle Bases.**Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs.**[Citation Graph (, )][DBLP]**Optimization Models for the Radio Planning of Wireless Mesh Networks.**[Citation Graph (, )][DBLP]**Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation.**[Citation Graph (, )][DBLP]**On the Consolidation of Data-Centers with Performance Constraints.**[Citation Graph (, )][DBLP]**On minimum reload cost paths, tours and flows.**[Citation Graph (, )][DBLP]**Column Generation for the Minimum Hyperplanes Clustering Problem.**[Citation Graph (, )][DBLP]**k-Hyperplane Clustering Problem: Column Generation and a Metaheuristic.**[Citation Graph (, )][DBLP]**Service Consolidation with End-to-End Response Time Constraints.**[Citation Graph (, )][DBLP]**Optimization models and methods for planning wireless mesh networks.**[Citation Graph (, )][DBLP]**A two-phase relaxation-based heuristic for the maximum feasible subsystem problem.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |