The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
This paper extends the set of problems for which a global solution can be found using modern optimization methods. In particular, the method is applied to estimation of the essent...
We address the problem of detecting batches of emails that have been created according to the same template. This problem is motivated by the desire to filter spam more effectivel...
—The goal of the Web Service Composition (WSC) problem is to find an optimal composition of web services to satisfy a given request using their syntactic and/or semantic feature...
— A facility location problem deals with locating the best place for a group of facilities, among distinct demand points, minimizing a certain locational optimization function. I...