Dagoberto R. Quevedo-Orozco

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
The capacitated vertex p-center problem is a well-known location problem that consists of placing p facilities and assigning customers to each of these facilities so as to minimize the largest distance between any customer and its assigned facility, subject to demand capacity constraints for each facility. In this work, a metaheuristic for this location(More)
  • 1