Asymptotic analysis of dichotomous search with search and travel costs
From MaRDI portal
(Redirected from Publication:1197653)
Recommendations
- Asymptotic results in search theory
- AN EXACTLY OPTIMAL STRATEGY FOR A SEARCH PROBLEM WITH TRAVELING COST
- Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times
- Asymptotic analysis of the optimal cost in some transportation problems with random locations
- scientific article; zbMATH DE number 903457
- scientific article; zbMATH DE number 954495
- Asymptotic analysis of a class of optimal location problems
- Two-sided search and perfect segregation with fixed search costs
Cites work
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 3430362 (Why is no real title available?)
- A DICHOTOMOUS SEARCH WITH TRAVEL COST
- A Dichotomous Search for a Geometric Random Variable
- A ONE-DIMENSIONAL SEARCH WITH TRAVELING COST
- Binary Search on a Tape
- Letter to the Editor—A Search Problem
- Optimal Computer Search Trees and Variable-Length Alphabetical Codes
- Recurrence relations based on minimization
- Some Theorems on Sorting
Cited in
(7)- An asymptotic theory for recurrence relations based on minimization and maximization.
- On dichotomous search with direction-dependent costs for a uniformly hidden object
- AN EXACTLY OPTIMAL STRATEGY FOR A SEARCH PROBLEM WITH TRAVELING COST
- Monotonicity and efficient computation of optimal dichotomous search
- Dichotomous Search for Random Objects on an Interval
- Operations research applications of dichotomous search
- Asymptotic results in search theory
This page was built for publication: Asymptotic analysis of dichotomous search with search and travel costs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197653)
