[cosc-grad-students-list] CSCI Research Seminar Series---Dr. Antonio Medrano

[Li, Longzhuang]

Hi, CS graduate students,

Dr. Antonio Medrano will be the second speaker in the CSCI Research Seminar Series. The title and abstract are as follows.

   Thanks,

Longzhuang

CSCI Research Seminar Series --- Dr. Antonio Medrano
Long Li 1:00 PM - 2:00 PM Friday, Oct 1 2021 (UTC-05:00) Central Time (US & Canada)
Top of Form
Bottom of Form
Top of Form
Bottom of Form
Join information
Meeting link:
https://tamucc.webex.com/tamucc/j.php?MTID=mf49595b5145cb29e748a62533f4425c8<https://nam12.safelinks.protection.outlook.com/?url=https%3A%2F%2Ftamucc.webex.com%2Ftamucc%2Fj.php%3FMTID%3Dmf49595b5145cb29e748a62533f4425c8&data=04%7C01%7Ccosc-grad-students-list%40listserv.tamucc.edu%7C3a544e0976464a67568b08d9844e987e%7C34cbfaf167a64781a9ca514eb2550b66%7C0%7C0%7C637686295355805349%7CUnknown%7CTWFpbGZsb3d8eyJWIjoiMC4wLjAwMDAiLCJQIjoiV2luMzIiLCJBTiI6Ik1haWwiLCJXVCI6Mn0%3D%7C1000&sdata=TCD%2FqRapxr2EyAD4qtQwaVRZ5wpm9hnJpWSzk9j2NkQ%3D&reserved=0>
Meeting number:
2452 326 0906
Password:
ZBcgAwVj226 (92242985 from phones)
Host key:
326651
Join by video system
Dial 24523260906 at tamucc.webex.com<mailto:24523260906 at tamucc.webex.com>
You can also dial 173.243.2.68 and enter your meeting number.
Join by phone
1-877-668-4493 Call-in toll free number (US/Canada)
1-650-479-3208 Call-in number (US/Canada)
Access code: 2452 326 0906
Host PIN: 6998


The Complete Vertex p-Center Problem
The vertex p-center problem consists of locating p facilities among a set of M potential sites such that the maximum distance from any demand to its closest located facility is minimized. The complete vertex p-center problem solves the p-center problem for all p from 1 to the total number of sites, resulting in a multi-objective trade-off curve between the number of facilities and the service distance required to achieve full coverage. This trade-off provides a reference to planners and decision-makers, enabling them to easily visualize the consequences of choosing different coverage design criteria for the given spatial configuration of the problem. This is important for location optimization applications such as locating cell-phone towers, fire station locations, and drone delivery services. I present two fast algorithms for solving the complete p-center problem, one using the classical formulation but trimming variables while still maintaining optimality, the other converting the problem to a location set covering problem and solving for all distances in the distance matrix. I will also discuss scenarios where it makes sense to solve the problem via brute-force enumeration. All methods result in significant speed-ups, with the set covering method reducing computation times by many orders of magnitude.


-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://listserv.tamucc.edu/pipermail/cosc-grad-students-list/attachments/20210930/362d6023/attachment.htm>