✦ LIBER ✦

The Complexity of the Optimal Searcher Path Problem

✍ Scribed by K. E. Trummel and J. R. Weisinger

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Path optimization for the resource-const

✍ Hiroyuki Sato; Johannes O. Royset 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 340 KB

Complexity analysis and optimization of

✍ Paola Festa 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 700 KB

Complexity of Path-Following Methods for

✍ Armentano, Diego 📂 Article 📅 2014 🏛 Springer-Verlag 🌐 English ⚖ 640 KB

Complexity of the path avoiding forbidde

✍ Kováč, Jakub 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 476 KB

New Bounds on the Complexity of the Shor

✍ Fredman, Michael L. 📂 Article 📅 1976 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 674 KB

On the complexity of the disjoint paths

✍ Matthias Middendorf; Frank Pfeiffer 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 554 KB