The point placement problem is to determine the positions of a linear set of points, P = {p1, p2, p3, . . . , pn}, uniquely, up to translation and reflection, from the fewest poss...
: This work deals with a classic problem: "Given a set of coins among which there is a counterfeit coin of a different weight, find this counterfeit coin using ordinary balanc...
We study a generalized framework for structured sparsity. It extends the well known methods of Lasso and Group Lasso by incorporating additional constraints on the variables as pa...
Luca Baldassarre, Jean Morales, Andreas Argyriou, ...
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
The multilevel generalized assignment problem (MGAP) is a variation of the generalized assignment problem, in which agents can execute tasks at different efficiency levels with di...