k-Center Problems with Minimum Coverage

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...

Full description

Saved in:
Bibliographic Details
Main Authors: LIM, Andrew, RODRIGUES, Brian, WANG, Fan, XU, Zhou
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2005
Subjects:
Approximation algorithm
k-center problem
Minimum coverage
Operations and Supply Chain Management
Online Access: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
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

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

Similar Items