✦ LIBER ✦

The multiple server center location problem

✍ Scribed by Robert Aboolian; Oded Berman; Zvi Drezner

Publisher: Springer US
Year: 2008
Tongue: English
Weight: 349 KB
Volume: 167
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-008-0341-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Center Location Improvement Problem

The Center Location Improvement Problem Under the Hamming Distance

✍ Binwu Zhang; Jianzhong Zhang; Yong He 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 116 KB

A multiple criteria model for the locati

A multiple criteria model for the location-allocation problem

✍ Sang M. Lee; Gary I. Green; Chang S. Kim 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 712 KB

Solving nonlinear multiple-facility netw

Solving nonlinear multiple-facility network location problems

✍ J. N. Hooker 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 751 KB

We show how to locate optimally p new facilities (servers) on a network so as to minimize cost, where cost can be any convex function of the distances between demand points (nodes) and a closest server. The algorithm is generally practical only for small p (perhaps 2, 3, or 4), but it admits a large

Multiple criteria facility location prob

Multiple criteria facility location problems: A survey

✍ Reza Zanjirani Farahani; Maryam SteadieSeifi; Nasrin Asgari 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 350 KB

A Wavefront Approach to Center Location

A Wavefront Approach to Center Location Problems with Barriers

✍ L. Frießs; K. Klamroth; M. Sprau 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 529 KB

The Distributedk-Server Problem—A Compet

The Distributedk-Server Problem—A Competitive Distributed Translator fork-Server Algorithms

✍ Yair Bartal; Adi Rosén 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 243 KB

Algorithms Ž . x 11 1990 , 208᎐230 in a distributed setting. Given a network of n processors and k identical mobile servers, requests for service appear at the processors and a server must reach the request point. In addition to modeling problems in computer networks where k identical mobile resour