Pages that link to "Item:Q5244863"
From MaRDI portal
The following pages link to Searching a Variable Speed Network (Q5244863):
Displayed 13 items.
- A search problem on a bipartite network (Q1735184) (← links)
- Weighted network search games with multiple hidden objects and multiple search teams (Q2028828) (← links)
- A game theoretic approach to a problem in polymatroid maximization (Q2098075) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Search for an immobile hider on a stochastic network (Q2286995) (← links)
- Approximate solutions for expanding search games on general networks (Q2327672) (← links)
- Search for an immobile hider in a known subset of a network (Q2328862) (← links)
- Search games on a network with travelling and search costs (Q2349413) (← links)
- Search Games for an Immobile Hider (Q2961391) (← links)
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object (Q3195234) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
- Optimal patrolling strategies for trees and complete networks (Q6096604) (← links)