Revisiting several problems and algorithms in Continuous Location with l_p norms
- đ¤ Speaker: El Haj Ben Ali, A (Universidad de Sevilla)
- đ Date & Time: Friday 19 July 2013, 10:30 - 11:00
- đ Venue: Seminar Room 1, Newton Institute
Abstract
This work addresses the general continuous single facility location problems in finite dimension spaces under possibly diferent l_p norms, p>=1, in the demand points. We analyze the dificulty of this family of problems and revisit convergence properties of some well-known algorithms. The ultimate goal is to provide a common approach to solve the family of continuous l_p ordered median location problems in dimension d (including of course the l_p minisum or Fermat-Weber location problem for any p>=1). We prove that this approach has a polynomial worst case complexity for monotone lambda weights and can be also applied to constrained and even non-convex problems.
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- dh539
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

El Haj Ben Ali, A (Universidad de Sevilla)
Friday 19 July 2013, 10:30-11:00