BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Isaac Newton Institute Seminar Series
SUMMARY:Revisiting several problems and algorithms in Cont
inuous Location with l_p norms - El Haj Ben Ali\,
A (Universidad de Sevilla)
DTSTART;TZID=Europe/London:20130719T103000
DTEND;TZID=Europe/London:20130719T110000
UID:TALK46297AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/46297
DESCRIPTION:This work addresses the general continuous single
facility location problems in finite dimension spa
ces under possibly diferent l_p norms\, p>=1\, in
the demand points. We analyze the dificulty of thi
s family of problems and revisit convergence prope
rties 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 p
roblems 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 polynomi
al worst case complexity for monotone lambda weigh
ts and can be also applied to constrained and even
non-convex problems.\n
LOCATION:Seminar Room 1\, Newton Institute
CONTACT:Mustapha Amrani
END:VEVENT
END:VCALENDAR