✦ LIBER ✦

Solving the constrained shortest path problem using random search strategy

✍ Scribed by KePing Li; ZiYou Gao; Tao Tang; LiXing Yang

Book ID: 107356772
Publisher: SP Science China Press
Year: 2010
Tongue: English
Weight: 429 KB
Volume: 53
Category: Article
ISSN: 1006-9321
DOI: 10.1007/s11431-010-4105-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving the undirected multicommodity fl

Solving the undirected multicommodity flow problem using a shortest path-based pricing algorithm

✍ Richard D. McBride; John W. Mamer 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

The use of a strategy language for solvi

The use of a strategy language for solving search problems

✍ Carlos Castro; Peter Borovanský 📂 Article 📅 2000 🏛 Springer Netherlands 🌐 English ⚖ 154 KB

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