๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A stochastic gradual cover location problem

โœ Scribed by Tammy Drezner; Zvi Drezner; Zvi Goldstein

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
80 KB
Volume
57
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

The gradual covering problem
The gradual covering problem
โœ Zvi Drezner; George O. Wesolowsky; Tammy Drezner ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 106 KB
A stochastic linear knapsack problem
A stochastic linear knapsack problem
โœ Shลgo Shiode; Hiroaki Ishi; Toshio Nishida ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 297 KB
On a stochastic bilevel programming prob
On a stochastic bilevel programming problem
โœ Stefanie Kosuch; Pierre Le Bodic; Janny Leung; Abdel Lisser ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 160 KB

## Abstract In this article, a mixed integer bilevel problem having a probabilistic knapsack constraint in the first level is proposed. The problem formulation is mainly motivated by practical pricing and service provision problems as it can be interpreted as a model for the interaction between a s

Numerical solution to a stochastic inter
Numerical solution to a stochastic interception problem
โœ Reuter, Gerhard W. ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 231 KB

A finite difference scheme is derived to solve for the probability density that a moving point, whose velocity is continually perturbed by Gaussian white noise, reaches a given target within a given time period. The numerical scheme is applied to the problem of finding the probability that two movin