✦ LIBER ✦

Multicriteria planar location problems

✍ Scribed by H.W. Hamacher; S. Nickel

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 1014 KB
Volume: 94
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(95)00186-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multicriteria network location problems

Multicriteria network location problems with sum objectives

✍ Hamacher, Horst W.; Labb�, Martine; Nickel, Stefan 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB

In this paper, network location problems with several objectives are discussed, where every single objective is a classical median objective function. We will look at the problem of finding Pareto optimal locations and lexicographically optimal locations. It is shown that for Pareto optimal location

Mixed planar/network facility location p

Mixed planar/network facility location problems

✍ Rajan Batta; Udatta S. Palekar 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 585 KB

A multicriteria assignment problem

✍ Antonino Scarelli; Subhash C. Narula 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

## Abstract Our objective in this paper is to propose a procedure for solving a multicriteria assignment problem. Given qualitative and quantitative data, the proposed procedure makes assignments taking into consideration the multicriteria aspect of the problem. As an illustrative example, we consi

Locating a Waste Treatment Facility by M

Locating a Waste Treatment Facility by Multicriteria Analysis

✍ JOONAS HOKKANEN; PEKKA SALMINEN 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB

We describe an application of multicriteria decision aid to the location of a waste treatment facility in eastern Finland. In Finland, the Act on Environmental Impact Assessment Procedure requires that when the amount of waste to be dealt with in a facility exceeds 20,000 tons per year, the process

Eulerian location problems

✍ Ghiani, Gianpaolo; Laporte, Gilbert 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 187 KB

The problem of locating a set of depots in an arc routing context (with no side constraints) is addressed. In the case of one depot, it is shown that the problem can be transformed into a Rural Postman Problem (RPP). In the case of a set of depots, the problem is also reduced to an RPP if there are

Production-location problems

✍ Arthur P. Hurter Jr; Enrique R. Venta 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 649 KB