Weighted network search games with multiple hidden objects and multiple search teams
From MaRDI portal
Publication:2028828
DOI10.1016/j.ejor.2020.06.046zbMath1487.91015OpenAlexW3038518759MaRDI QIDQ2028828
Abdolmajid Yolmeh, Melike Baykal-Gürsoy
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2020.06.046
Search theory (90B40) Games involving graphs (91A43) Positional games (pursuit and evasion, etc.) (91A24)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Infrastructure security games
- New dominance rules and exploration strategies for the \(1|r _{i}|\sum U _{i }\) scheduling problem
- A two-player competitive discrete location model with simultaneous decisions
- A branch, bound, and remember algorithm for the \(1|r _{i }|\sum t _{i }\) scheduling problem
- Optimal search for one of many objects hidden in two boxes
- Continuous and discrete search for one of many objects
- Search games
- Compact extended linear programming models
- A BB\&R algorithm for minimizing total tardiness on a single machine with sequence dependent setup times
- Searching for multiple objects in multiple locations
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
- Search games on a network with travelling and search costs
- Two-player simultaneous location game: preferential rights and overbidding
- Weighted search games
- Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
- A Branch, Bound, and Remember Algorithm for the Simple Assembly Line Balancing Problem
- SEARCH GAMES: LITERATURE AND SURVEY
- Search Games with Multiple Hidden Objects
- Find-and-Fetch Search on a Tree
- Search Games: A Review
- Tools to Manage Search Games on Lattices
- Disperse or Unite? A Mathematical Model of Coordinated Attack
- Search Games on Trees with Asymmetric Travel Times
- Online Linear Optimization over Permutations
- Network search games, with arbitrary searcher starting point
- Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object
- The search for an intelligent evader concealed in one of an arbitrary number of regions
- Branch-and-Bound Strategies for Dynamic Programming
- The search for an intelligent evader: Strategies for searcher and evader in the two-region problem
- Search Games with Mobile and Immobile Hider
- Hide-and-Seek Games on a Network, Using Combinatorial Search Paths
- Cyclic best first search: Using contours to guide branch‐and‐bound algorithms
- Game Theory
- Searching a Variable Speed Network
- Mining Coal or Finding Terrorists: The Expanding Search Paradigm
- A Periodic Optimal Search
This page was built for publication: Weighted network search games with multiple hidden objects and multiple search teams
