Approximately optimal one‐dimensional search policies in which search costs vary through time

DOI10.1002/NAV.3800080309zbMATH Open0126.15803OpenAlexW2066736533MaRDI QIDQ5332964FDOQ5332964

Authors: B. Gluss 

Publication date: 1961

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800080309

zbMATH Keywords

operations research

Cites Work

• Title not available (Why is that?)

Cited In (6)

• A search problem on a bipartite network
• Estimation of distributions involving unobservable events: the case of optimal search with unknown target distributions
• Rendezvous search on a star graph with examination costs
• A search problem with considering posterior treatments for a detected object
• Optimal trade-off between speed and acuity when searching for a small object
• A search game with unknown examination costs and travel times

This page was built for publication: Approximately optimal one‐dimensional search policies in which search costs vary through time

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