We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
The paper presents an evaluation-relaxation scheme where a fitness surrogate automatically adapts to the problem structure and the partial contributions of subsolutions to the fit...
Abstract— In this paper we propose a method for joint optimization of transceivers with fractionally spaced equalization (FSE). We use the effective single-input multiple-output ...
We study the optimal control of propagation of packets in delay tolerant mobile ad-hoc networks. We consider a two-hop forwarding policy under which the expected number of nodes ca...
Eitan Altman, Tamer Basar, Francesco De Pellegrini
We present a general semidefinite relaxation scheme for general n-variate quartic polynomial optimization under homogeneous quadratic constraints. Unlike the existing sum-of-squar...