Search-hide games on trees

DOI10.1016/0377-2217(93)E0362-2zbMath0928.91009OpenAlexW2095579476MaRDI QIDQ1129971

Buyang Cao

Publication date: 9 January 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0362-2

zbMATH Keywords

polynomial algorithmLagrangian heuristicsearch-hide games on trees

Mathematics Subject Classification ID

Linear programming (90C05) Search theory (90B40) Positional games (pursuit and evasion, etc.) (91A24) Probabilistic games; gambling (91A60)

Related Items (6)

A competitive search game with a moving target ⋮ Complexity of searching an immobile hider in a graph ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Search for an immobile hider on a stochastic network ⋮ Upper and lower bounding procedures for minimum rooted \(k\)-subtree problem ⋮ Static search games played over graphs and general metric spaces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Routing with time windows by column generation
• Totally-Balanced and Greedy Matrices
• Pursuit—Evasion games on graphs
• A hide–search game
• Mazes: Search games on unknown networks
• Weighted k‐cardinality trees: Complexity and polyhedral structure
• A set‐partitioning‐based exact algorithm for the vehicle routing problem

This page was built for publication: Search-hide games on trees