This work is concerned with the structure of bilinear minimization problems arising in recovering subsampled and modulated images in parallel magnetic resonance imaging. By consid...
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
Abstract— This paper presents a comparison of four bioinspired algorithms (all seen as search engines) with a similar constraint-handling mechanism (Deb’s feasibility rules) to...
We propose and study a new information transmission problem motivated by today’s internet. A real number, perhaps representing control information in a network, is encoded using...
Vehicle routing problem (VRP) is a well-known combinatorial optimization and nonlinear programming problem seeking to service a number of customers with a fleet of vehicles. This ...