BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Revisiting several problems and algorithms in Continuous Location 
 with l_p norms - El Haj Ben Ali\, A (Universidad de Sevilla)
DTSTART:20130719T093000Z
DTEND:20130719T100000Z
UID:TALK46297@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:This work addresses the general continuous single facility loc
 ation problems in finite dimension spaces under possibly diferent l_p norm
 s\, p>=1\, in the demand points. We analyze the dificulty of this family o
 f problems and revisit convergence properties of some well-known algorithm
 s. The ultimate goal is to provide a common approach to solve the family o
 f continuous l_p ordered median location problems in dimension d (includin
 g 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 m
 onotone lambda weights and can be also applied to constrained and even non
 -convex problems.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR