Operations research applications of dichotomous search
From MaRDI portal
Publication:1681128
DOI10.1016/j.ejor.2017.07.031zbMath1374.90322OpenAlexW2734772720MaRDI QIDQ1681128
Publication date: 23 November 2017
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2017.07.031
Related Items
An exact algorithm for large knapsack sharing problems, The faulty Satnav (GPS) problem: search for home in networks with unreliable directions, An equilibrium model of the supply chain network under multi-attribute behaviors analysis
Cites Work
- On Finding the Maximal Range of Validity of a Constrained System
- A DICHOTOMOUS SEARCH WITH TRAVEL COST
- Binary Trees Optimum Under Various Criteria
- The Optimal Alphabetic Tree Problem Revisited
- Parallelized Huffman and Hu-Tucker searching
- A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees
- Economic optimization of off-line inspection with inspection errors
- Optimum lopsided binary trees
- Discrete Search with Directional Information
- Isolating a Single Defective Using Group Testing
- Upper and Lower Bounds on Constructing Alphabetic Binary Trees
- Alphabetic Minimax Trees in Linear Time
- A High-Low Search Algorithm for a Newsboy Problem with Delayed Information Feedback
- Stochastic Convex Optimization with Bandit Feedback
- A Linear Search Problem
- Letter to the Editor—A Search Problem
- Maintenance Policies for Stochastically Failing Equipment: A Survey
- On the complexity of search algorithms
- Economic optimization of off-line inspection procedures with inspection errors
- On a more general formulation of off-line inspection with inspection errors
- Algorithms – ESA 2005
- A Method for the Construction of Minimum-Redundancy Codes
- Parallel minimax search for a maximum
- Some Theorems on Sorting
- Optimal variable length codes (arbitrary symbol cost and equal code word probability)
- Optimal Computer Search Trees and Variable-Length Alphabetical Codes
- Path Length of Binary Search Trees
- Efficiency of the Fibonacci search method
- A New Proof of the T-C Algorithm
- Bounds for Weight Balanced Trees
- On dichotomous search with direction-dependent costs for a uniformly hidden object
- Sequential Minimax Search for a Maximum
- Optimal binary search trees
- Efficient algorithms for chemical threshold testing problems
- Lopsided trees. I: Analyses
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal alphabetic trees for binary search
- Product inspection policy for an imperfect production system with inspection errors and warranty cost
- An exact decomposition algorithm for the generalized knapsack sharing problem
- Query strategies for priced information
- Utilizing the information theory of entropy to solve an off-line inspection problem
- Optimal alphabetic binary tree for a nonregular cost function
- Economic off-line quality control strategy with two types of inspection errors
- Trees with exponentially growing costs
- Economic optimization of off-line inspection with rework consideration
- Alphabetic coding with exponential costs
- Binary search with delayed and missing answers
- Optimal search for rationals
- Optimum ordered bi-weighted binary trees
- An extended result of Kleitman and Saks concerning binary trees
- Interpolation-binary search
- Selection of the optimum uniform partition search
- Coping with errors in binary search procedures
- On the costs of optimal and near-optimal binary search trees
- On search over rationals
- Information and rationality asymmetries in a simple high-low search wage model
- Asymptotic analysis of dichotomous search with search and travel costs
- Optimal alphabetic search trees with restricted maximal height
- Optimal \(\alpha -\beta\) trees with capacity constraint
- Rational search
- On a generalization of binary search
- Efficient search for rationals
- Monotonicity and efficient computation of optimal dichotomous search
- The optimal binary search tree for Andersson's search algorithm
- Delayed binary search, or playing twenty questions with a procrastinator
- A dynamic model of collective bargaining
- An asymptotic theory for recurrence relations based on minimization and maximization.
- Optimal binary search trees with costs depending on the access paths.
- The theory of search games and rendezvous.
- Relative impatience determines preference between contract bargaining and repeated bargaining
- The binary identification problem for weighted trees
- On the query complexity of finding a local maximum point.
- A strategy for searching with different access costs.
- A problem of minimax estimation with directional information
- A parallel algorithm for optimum height-limited alphabetic binary trees
- Isotonicity of minimizers in polychotomous discrete interval search via lattice programming
- Binary searching with nonuniform costs and its application to text retrieval
- On the Huffman and alphabetic tree problem with general cost functions
- Adaptive search over sorted sets
- On binary search trees
- Economic optimization of off-line inspection in a process that also produces non-conforming units when in control and conforming units when out of control
- A sorting function
- Optimum binary search trees
- On Binary Searching with Nonuniform Costs
- Bisection Search with Noisy Responses
- Open Problems on Search Games
- Global Optimization for Multi-Channel Wireless Data Broadcast with AH-Tree Indexing Scheme
- Integrated on-line and off-line quality control for products with destructive testing
- On an efficient dynamic programming technique of F. F. Yao
- Construction of Optimal $\alpha $-$\beta $ Leaf Trees with Applications to Prefix Code and Information Retrieval
- An Asymptotic Solution of Dresher’s Guessing Game
- On a problem of optimal search
- Fibonaccian searching
- Dichotomous Search for Random Objects on an Interval
- Binary search trees with binary comparison cost
- A Dichotomous Search for a Geometric Random Variable
- Bounds on the redundancy of binary alphabetical codes
- A New Algorithm for Building Alphabetic Minimax Trees
- AN OFFLINE INSPECTION AND DISPOSITION MODEL INCORPORATING DISCRETE WEIBULL DISTRIBUTION AND MANUFACTURING VARIATION
- Near-Optimal Depth-Constrained Codes
- A High–Low search game on the unit interval
- Alphabetic Minimax Trees
- A minmax search for the critical level of a system: The asymmetric case
- Search for point in interval, with high–low feedback
- Alphabetic Minimax Trees of Degree at Most t
- An optimal algorithm for finding all the jumps of a monotone step-function
- Sequential vs. Binary Batched Searching
- A new proof of the Garsia-Wachs algorithm
- A subquadratic algorithm for constructing approximately optimal binary search trees
- Binary Search on a Tape
- Search in an Ordered Array Having Variable Probe Cost
- Interactive High-low Search: The Case of Lost Sales
- Ranking the Best Binary Trees
- Sequential transmission using noiseless feedback
- Combinatorial Optimization with Rational Objective Functions
- The construction of optimal multiway search trees and the monotonicity principle
- Optimal maintenance models for systems subject to failure–A Review
- Optimal Multi-Way Search Trees
- Codes: Unequal Probabilities, Unequal Letter Cost
- Speed-Up in Dynamic Programming
- Set Orderings Requiring Costliest Alphabetic Binary Trees
- A Discrete Search Game
- Efficient Generation of Optimal Prefix Code
- Optimal Alphabetic Trees
- Bounds for optimalα-β binary trees
- A Best Possible Bound for The Weighted Path Length of Binary Search Trees
- A New Algorithm for Minimum Cost Binary Trees
- A Stochastic Search Game
- Interpolation search—a log log N search
