𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion

✍ Scribed by Kasperski, Adam; Zieliński, Paweł

Book ID
123140814
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
404 KB
Volume
41
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal strategy of route and look for t
Optimal strategy of route and look for the path constrained search problem with reward criterion
✍ Ryusuke Hohzaki; Koji Iida 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 741 KB

A target is moving among a finite number of cells K= {1 ..... K} in discrete time T= {1 ..... T}. Knowing the probability of the target's path selection, a searcher is searching for the target with constraints that he can move from cell i to one of the adjacent cells l(i). The searcher detects the t