Annals of Operations Research

, Volume 167, Issue 1, pp 337-352

First online:

The multiple server center location problem

  • Robert AboolianAffiliated withCollege of Business Administration, California State University San Marcos Email author 
  • , Oded BermanAffiliated withJoseph L. Rotman School of Management, University of Toronto
  • , Zvi DreznerAffiliated withCollege of Business and Economics, California State University Fullerton

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


In this paper, we introduce the multiple server center location problem. p servers are to be located at nodes of a network. Demand for services of these servers is located at each node, and a subset of nodes are to be chosen to locate one or more servers in each. Each customer selects the closest server. The objective is to minimize the maximum time spent by any customer, including travel time and waiting time at the server sites. The problem is formulated and analyzed. Results for heuristic solution approaches are reported.