Search-hide games on trees

DOI10.1016/0377-2217(93)E0362-2MaRDI QIDQ1129971zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A SEARCH GAME WITH TRAVELING COST ON A TREE
• Complexity of searching an immobile hider in a graph
• Hide-and-seek games on a tree to which Eulerian networks are attached
• Publication:3204351
• Manhunting -- a simple search game

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 2166303 (Why is no real title available?)
• A hide–search game
• A set‐partitioning‐based exact algorithm for the vehicle routing problem
• Mazes: Search games on unknown networks
• Pursuit—Evasion games on graphs
• Routing with time windows by column generation
• Totally-Balanced and Greedy Matrices
• Weighted k‐cardinality trees: Complexity and polyhedral structure

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129971)