Weighted network search games with multiple hidden objects and multiple search teams
From MaRDI portal
Publication:2028828
Recommendations
- Search games with multiple hidden objects
- Search games on a network with travelling and search costs
- The search game on a network with immobile hider
- Approximate solutions for expanding search games on general networks
- Network search games with immobile hider, without a designated searcher starting point
Cites work
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
- A branch, bound, and remember algorithm for the simple assembly line balancing problem
- A Periodic Optimal Search
- A two-player competitive discrete location model with simultaneous decisions
- Branch-and-Bound Strategies for Dynamic Programming
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
- Compact extended linear programming models
- Continuous and discrete search for one of many objects
- Cyclic best first search: using contours to guide branch-and-bound algorithms
- Disperse or Unite? A Mathematical Model of Coordinated Attack
- Find-and-fetch search on a tree
- Game theory. An introduction
- Hide-and-seek games on a network, using combinatorial search paths
- scientific article; zbMATH DE number 18884 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- scientific article; zbMATH DE number 3245077 (Why is no real title available?)
- Infrastructure security games
- Mining coal or finding terrorists: the expanding search paradigm
- Network search games, with arbitrary searcher starting point
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
- Online linear optimization over permutations
- Optimal search for one of many objects hidden in two boxes
- Optimal trade-off between speed and acuity when searching for a small object
- Optimization by simulated annealing
- Search games
- Search games on a network with travelling and search costs
- Search games on trees with asymmetric travel times
- Search Games with Mobile and Immobile Hider
- Search games with multiple hidden objects
- Search games: a review
- Search games: literature and survey
- Searching a variable speed network
- Searching for multiple objects in multiple locations
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- The search for an intelligent evader concealed in one of an arbitrary number of regions
- The search for an intelligent evader: Strategies for searcher and evader in the two-region problem
- Tools to manage search games on lattices
- Two-player simultaneous location game: preferential rights and overbidding
- Weighted search games
Cited in
(5)
This page was built for publication: Weighted network search games with multiple hidden objects and multiple search teams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2028828)
