𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Probabilistic location problems with discrete demand weights

✍ Scribed by Oded Berman; Jiamin Wang

Publisher
John Wiley and Sons
Year
2004
Tongue
English
Weight
156 KB
Volume
44
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Replacing continuous demand with discret
Replacing continuous demand with discrete demand in a competitive location model
✍ Tammy Drezner; Zvi Drezner πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 214 KB

Location models commonly represent demand as discrete points rather than as continuously spread over an area. This modeling technique introduces inaccuracies to the objective function and consequently to the optimal location solution. In this article this inaccuracy is investigated by the study of a

Location problems with grouped structure
Location problems with grouped structure of demand: Complexity and algorithms
✍ Averbakh, Igor; Berman, Oded πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 162 KB

We study generalizations of classical multifacility location problems, where customers' demand has a hierarchial structure, i.e., the set of local customers is partitioned into categories (global customers), each having its own requirements for quality of service. For the case of identical facilitie

The 1-minimax and 1-maximin problems wit
The 1-minimax and 1-maximin problems with demand weights of general probability distributions
✍ Oded Berman; Jiamin Wang πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 155 KB

## Abstract This paper investigates the 1‐minimax and 1‐maximin problems when demand weights are random variables with general continuous probability distributions. Properties of the optimal solutions are presented and solution procedures are developed. We also identify some known probability distr