The following pages link to E. Amaldi (Q325442):
Displaying 38 items.
- On the computational complexity of the virtual network embedding problem (Q325446) (← links)
- Discrete optimization methods to fit piecewise affine models to data points (Q342537) (← links)
- Ectropy of diversity measures for populations in Euclidean space (Q545352) (← links)
- On the approximability of the minimum strictly fundamental cycle basis problem (Q629358) (← links)
- Hyperbolic set covering problems with competing ground-set elements (Q715069) (← links)
- Optimizing base station location and configuration in UMTS networks (Q863576) (← links)
- (Q937379) (redirect page) (← links)
- Optimization models and methods for planning wireless mesh networks (Q937384) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
- A review of combinatorial problems arising in feedforward neural network design (Q1331904) (← links)
- The MIN PFS problem and piecewise linear model estimation (Q1348259) (← links)
- The complexity and approximability of finding maximum feasible subsystems of linear relations (Q1367542) (← links)
- On the maximum feasible subsystem problem, IISs and IIS-hypergraphs (Q1396834) (← links)
- A distance-based point-reassignment heuristic for the \(k\)-hyperplane clustering problem (Q2253617) (← links)
- Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
- A two-phase relaxation-based heuristic for the maximum feasible subsystem problem (Q2459384) (← links)
- A two-phase heuristic for the bottleneck \(k\)-hyperplane clustering problem (Q2636610) (← links)
- On minimum reload cost paths, tours, and flows (Q3008920) (← links)
- Solving Nonlinear Covering Problems Arising in WLAN Design (Q3013927) (← links)
- On the Hazmat Transport Network Design Problem (Q3091516) (← links)
- A MILP-Based Heuristic for Energy-Aware Traffic Engineering with Shortest Path Routing (Q3091530) (← links)
- Maximum Throughput Network Routing Subject to Fair Flow Allocation (Q3195309) (← links)
- Provisioning virtual private networks under traffic uncertainty (Q3418126) (← links)
- Virtual Private Network Design Under Traffic Uncertainty (Q3439121) (← links)
- Algorithms for finding minimum fundamental cycle bases in graphs (Q3439123) (← links)
- Efficient Deterministic Algorithms for Finding a Minimum Cycle Basis in Undirected Graphs (Q3569834) (← links)
- Randomized Relaxation Methods for the Maximum Feasible Subsystem Problem (Q3596360) (← links)
- Breaking the O(m 2 n) Barrier for Minimum Cycle Bases (Q3639255) (← links)
- (Q4263701) (← links)
- (Q4530825) (← links)
- (Q4899827) (← links)
- Mathematical models and a constructive heuristic for finding minimum fundamental cycle bases (Q4928243) (← links)
- (Q4942660) (← links)
- (Q5294077) (← links)
- Boundedness Theorems for the Relaxation Method (Q5387956) (← links)
- (Q5708523) (← links)
- Approximation and Online Algorithms (Q5896929) (← links)
