✦ LIBER ✦

Planar Location Problems with Block Distance and Barriers

✍ Scribed by P. M. Dearing; K. Klamroth; R. Segars

Publisher: Springer US
Year: 2005
Tongue: English
Weight: 650 KB
Volume: 136
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-005-2042-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minisum location problem with farthest E

Minisum location problem with farthest Euclidean distances

✍ Jian-lin Jiang; Ya Xu 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 292 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

Dominating sets for rectilinear center l

Dominating sets for rectilinear center location problems with polyhedral barriers

✍ P.M. Dearing; H.W. Hamacher; K. Klamroth 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB

## Abstract In planar location problems with barriers one considers regions which are forbidden for the siting of new facilities as well as for trespassing. These problems are important since they model various actual applications. The resulting mathematical models have a nonconvex objective functi

Solution of minisum and minimax location

Solution of minisum and minimax location–allocation problems with Euclidean distances

✍ Reuven Chen 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 671 KB

Planar point-objective location problems

Planar point-objective location problems with nonconvex constraints: A geometrical construction

✍ E. Carrizosa; E. Conde; M. Muñoz-Marquez; J. Puerto 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 407 KB

Distance weighted voting and a single fa

Distance weighted voting and a single facility location problem

✍ Rakesh V. Vohra 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 410 KB