Rendezvous search on a star graph with examination costs
type: Item
instance of: scholarly article
title: Rendezvous search on a star graph with examination costs
zbMATH Open document ID: 1121.90070
author: Kensaku Kikuta
author: William H. Ruckle
published in: European Journal of Operational Research
publication date: 2007-03-27T00:00:00Z
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 5137732
zbMATH Keywords: search theory
zbMATH Keywords: applied probability
zbMATH Keywords: group decisions and negotiations
MaRDI profile type: Publication
full work available at URL: j.ejor.2006.06.017
OpenAlex ID: W2068956636
cites work: Rendezvous search on a graph
cites work: Rendezvous search on labeled networks
cites work: The rendezvous problem on discrete locations
cites work: Note: Two rendezvous search problems on the line
cites work: Approximately optimal one‐dimensional search policies in which search costs vary through time
cites work: A HIDE AND SEEK GAME WITH TRAVELING COST
cites work: Minimax Rendezvous on the Line
DOI: 10.1016/J.EJOR.2006.06.017
Recommended article: Rendezvous search on a graph
Recommended article: Q4489244
Recommended article: The Rendezvous Search Problem
Recommended article: Rendezvous search on the line with bounded resources: Expected time minimization
Recommended article: On the probability of rendezvous in graphs
Recommended article: Rendezvous search on labeled networks
Recommended article: Q5224834
Recommended article: Algorithms - ESA 2003
description: scientific article; zbMATH DE number 5137732