Pages that link to "Item:Q5301126"
From MaRDI portal
The following pages link to Mining Coal or Finding Terrorists: The Expanding Search Paradigm (Q5301126):
Displaying 29 items.
- Historical evolution and benefit-cost explanation of periodical fluctuation in coal mine safety supervision: an evolutionary game analysis framework (Q319258) (← links)
- On the approximation ratio of the random Chinese postman tour for network search (Q1694817) (← links)
- The search value of a set (Q1699127) (← links)
- A search problem on a bipartite network (Q1735184) (← links)
- The expanding search ratio of a graph (Q1741496) (← links)
- Tree optimization based heuristics and metaheuristics in network construction problems (Q2027081) (← links)
- A polynomial-time method to compute all Nash equilibria solutions of a general two-person inspection game (Q2028790) (← 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)
- Further connections between contract-scheduling and ray-searching problems (Q2142675) (← links)
- Network construction/restoration problems: cycles and complexity (Q2168711) (← links)
- Search and delivery man problems: when are depth-first paths optimal? (Q2184055) (← links)
- Search and rescue in the face of uncertain threats (Q2184077) (← links)
- Competitive search in a network (Q2184175) (← 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)
- The pairwise flowtime network construction problem (Q2670455) (← links)
- Search Games for an Immobile Hider (Q2961391) (← links)
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object (Q3195234) (← links)
- Technical Note—Trading Off Quick versus Slow Actions in Optimal Search (Q3453336) (← links)
- Exact and Approximation Algorithms for the Expanding Search Problem (Q5084651) (← links)
- A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games (Q5126630) (← links)
- Searching a Variable Speed Network (Q5244863) (← links)
- Optimal patrolling strategies for trees and complete networks (Q6096604) (← links)
- The search and rescue game on a cycle (Q6100190) (← links)
