On dichotomous search with direction-dependent costs for a uniformly hidden object

DOI10.1080/02331939008843538zbMath0721.90048OpenAlexW2153896671MaRDI QIDQ5753737

Karl Hinderer

Publication date: 1990

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939008843538

zbMATH Keywords

asymptotic analysisdichotomous searchuniformly hidden object

Mathematics Subject Classification ID

Search theory (90B40) Dynamic programming (90C39) Markov and semi-Markov decision processes (90C40) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (7)

On polychotomous search problems ⋮ Increasing Lipschitz continuous maximizers of some dynamic programs ⋮ A problem of minimax estimation with directional information ⋮ Operations research applications of dichotomous search ⋮ An asymptotic theory for recurrence relations based on minimization and maximization. ⋮ On the cost of optimal alphabetic code trees with unequal letter costs ⋮ Monotonicity and efficient computation of optimal dichotomous search

Cites Work

• Some Theorems on Sorting
• Unnamed Item
• Unnamed Item

This page was built for publication: On dichotomous search with direction-dependent costs for a uniformly hidden object