A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Solving the Capacitated Vertex K-Center Problem through the Minimum Capacitated Dominating Set Problem
2020
Mathematics
The capacitated vertex k-center problem receives as input a complete weighted graph and a set of capacity constraints. Its goal is to find a set of k centers and an assignment of vertices that does not violate the capacity constraints. Furthermore, the distance from the farthest vertex to its assigned center has to be minimized. The capacitated vertex k-center problem models real situations where a maximum number of clients must be assigned to centers and the travel time or distance from the
doi:10.3390/math8091551
fatcat:dncgwqff3nhp7jbuptpplpuz3y