### Antonio Rodríguez-Chía (University of Cádiz, Spain)

#### On k-sum optimization

*Wednesday 27 July 2016 at 15.00, JCMB 5327*

##### Abstract

In this talk, we address continuous, integer and combinatorial k-sum
optimization problems. We analyse different formulations of this problem that
allow to solve it through the minimization of a relatively small number of
minisum optimization problems.

This approach provides a general tool for solving a variety of k-sum
optimization problems and, at the same time, improves the complexity bounds of
many ad-hoc algorithms previously reported in the literature for particular
versions of this problem. Moreover, the results developed for k-sum
optimization have been extended to the more general case of the convex ordered
median problem, improving upon existing solution approaches.

### Seminars by year

*Current*
*2016*
*2015*
*2014*
*2013*
*2012*
*2011*
*2010*
*2009*
*2008*
*2007*
*2006*
*2005*
*2004*
*2003*
*2002*
*2001*
*2000*
*1999*
*1998*
*1997*
*1996*