𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Queueing-location problems on the plane

✍ Scribed by Zvi Drezner; Siegfried Schaible; David Simchi-Levi

Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
372 KB
Volume
37
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the inverse emergent plane crack prob
On the inverse emergent plane crack problem
✍ StΓ©phane Andrieux; Amel Ben Abda; Mohamed Jaoua πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 131 KB πŸ‘ 2 views

This paper deals with the detection of emergent plane cracks, by using boundary measurements. An identifiability result (uniqueness of the solution) is first proved. Then, we look at the stability of this solution with respect to the measurement. A weak stability result is proved, as well as a Lipsh

The local Steiner problem in normed plan
The local Steiner problem in normed planes
✍ Konrad J. Swanepoel πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 174 KB πŸ‘ 1 views
On the lottery problem
On the lottery problem
✍ ZoltΓ‘n FΓΌredi; GΓ‘bor J. SzΓ©kely; ZoltΓ‘n Zubor πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 290 KB πŸ‘ 2 views

Let L(n, k, k, t ) denote the minimum number of k-subsets of an n-set such that all the ( i ) k-sets are intersected by one of them in at least t elements. In this article L(n,k,k,Z) is calculated for infinite sets of n's. We obtain L(90,5,5,2) = 100, i.e., 100 tickets needed to guarantee 2 corr