A search problem on a bipartite network
From MaRDI portal
Publication:1735184
DOI10.1016/j.ejor.2019.02.029zbMath1430.90306OpenAlexW2916728425WikidataQ128391477 ScholiaQ128391477MaRDI QIDQ1735184
Publication date: 28 March 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.02.029
applied probabilityoptimal search strategyexistence probabilityminimum expected search costmoving and search costs
Related Items
Search and delivery man problems: when are depth-first paths optimal? ⋮ Entangled rendezvous: a possible application of Bell non-locality for mobile agents on networks ⋮ Search-and-rescue rendezvous
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal search with positive switch cost is NP-hard
- Search games
- Theory of optimal search
- The theory of search games and rendezvous.
- Optimizing periodic patrols against short attacks on the line and other networks
- On the approximation ratio of the random Chinese postman tour for network search
- Search games on a network with travelling and search costs
- The solution to an open problem for a caching game
- SEARCH GAMES: LITERATURE AND SURVEY
- Patrolling a Border
- Search Games: A Review
- Rendezvous search with markers that can be dropped at chosen times
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object
- Technical Note—Trading Off Quick versus Slow Actions in Optimal Search
- Discrete Sequential Search with Positive Switch Cost
- AN EXACTLY OPTIMAL STRATEGY FOR A SEARCH PROBLEM WITH TRAVELING COST
- SEARCH GAMES ON A BROKEN WHEEL WITH TRAVELING AND SEARCH COSTS
- Hide-and-Seek Games on a Network, Using Combinatorial Search Paths
- The Rendezvous Search Problem
- Search Theory
- Searching a Variable Speed Network
- On the Multichannel Rendezvous Problem: Fundamental Limits, Optimal Hopping Sequences, and Bounded Time-to-Rendezvous
- Mining Coal or Finding Terrorists: The Expanding Search Paradigm
- Approximately optimal one‐dimensional search policies in which search costs vary through time
- A ONE-DIMENSIONAL SEARCH WITH TRAVELING COST
