Search games on networks with travelling and search costs and with arbitrary searcher starting points (Q5326807): Difference between revisions

Latest revision as of 18:10, 6 July 2024

scientific article; zbMATH DE number 6195700

Language	Label	Description	Also known as
English	Search games on networks with travelling and search costs and with arbitrary searcher starting points	scientific article; zbMATH DE number 6195700

Statements

instance of

scholarly article

0 references

title

Search games on networks with travelling and search costs and with arbitrary searcher starting points (English)

0 references

zbMATH Open document ID

0 references

0 references

0 references

0 references

0 references

6 August 2013

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

search game on a network

0 references

search game with travelling and search costs

0 references

search game with immobile hider

0 references

search game with searcher choosing his starting point

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1002/net.21504

0 references

OpenAlex ID

W2089608722

0 references

cites work

Search Games on Trees with Asymmetric Travel Times

0 references

Searching symmetric networks with Utilitarian-Postman paths

0 references

The theory of search games and rendezvous.

0 references

Min-Max <i>K</i> -vehicles windy rural postman problem

0 references

The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra

0 references

Network search games, with arbitrary searcher starting point

0 references

On the optimality of a simple strategy for searching graphs

0 references

A SEARCH GAME WITH TRAVELING COST ON A TREE

0 references

A search game on a cyclic graph

0 references

Initial point search on weighted trees

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5326807

@@ Property / author @@
-Kensaku Kikuta
@@ Property / author: Kensaku Kikuta / rank @@
-Normal rank
@@ Property / author @@
+Kensaku Kikuta
@@ Property / author: Kensaku Kikuta / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/net.21504
@@ Property / full work available at URL: https://doi.org/10.1002/net.21504 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2089608722
@@ Property / OpenAlex ID: W2089608722 / rank @@
+Normal rank
@@ Property / cites work @@
+Search Games on Trees with Asymmetric Travel Times
+Normal rank
@@ Property / cites work @@
+Searching symmetric networks with Utilitarian-Postman paths
+Normal rank
@@ Property / cites work @@
+The theory of search games and rendezvous.
@@ Property / cites work: The theory of search games and rendezvous. / rank @@
+Normal rank
@@ Property / cites work @@
+Min-Max <i>K</i> -vehicles windy rural postman problem
+Normal rank
@@ Property / cites work @@
+The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
+Normal rank
@@ Property / cites work @@
+Network search games, with arbitrary searcher starting point
+Normal rank
@@ Property / cites work @@
+On the optimality of a simple strategy for searching graphs
+Normal rank
@@ Property / cites work @@
+A SEARCH GAME WITH TRAVELING COST ON A TREE
@@ Property / cites work: A SEARCH GAME WITH TRAVELING COST ON A TREE / rank @@
+Normal rank
@@ Property / cites work @@
+A search game on a cyclic graph
@@ Property / cites work: A search game on a cyclic graph / rank @@
+Normal rank
@@ Property / cites work @@
+Initial point search on weighted trees
@@ Property / cites work: Initial point search on weighted trees / rank @@
+Normal rank