k-Center Problems with Minimum Coverage
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirements to balance the workload of centers while allowing each center to cater to a spread of clients. We study three variants...
محفوظ في:
المؤلفون الرئيسيون: | LIM, Andrew, RODRIGUES, Brian, WANG, Fan, XU, Zhou |
---|---|
التنسيق: | text |
اللغة: | English |
منشور في: |
Institutional Knowledge at Singapore Management University
2005
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://ink.library.smu.edu.sg/lkcsb_research/2817 https://ink.library.smu.edu.sg/context/lkcsb_research/article/3816/viewcontent/kcenterProblemsMinCoverage_2005_pv.pdf |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
k-Center Problems with Minimum Coverage
بواسطة: LIM, Andrew, وآخرون
منشور في: (2004) -
An Analysis of the Extended Christofides Heuristic for the k-depot Travelling Salesman Problem
بواسطة: XU, Zhou, وآخرون
منشور في: (2011) -
Complete multi-robot coverage of unknown environments with minimum repeated coverage
بواسطة: Ge, S.S., وآخرون
منشور في: (2014) -
An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem
بواسطة: XU, Zhou, وآخرون
منشور في: (2017) -
k-Center problems with minimum coverage
بواسطة: Rodrigues, Brian, وآخرون
منشور في: (2004)