Operations research applications of dichotomous search
type: Item
instance of: scholarly article
title: Operations research applications of dichotomous search
zbMATH Open document ID: 1374.90322
author: Refael Hassin
author: Anna Sarid
published in: European Journal of Operational Research
publication date: 2017-11-23T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B40
zbMATH DE Number: 6811637
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: dichotomous search
zbMATH Keywords: alphabetic trees
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.07.031
OpenAlex ID: W2734772720
cites work: A minmax search for the critical level of a system: The asymmetric case
cites work: Parallelized Huffman and Hu-Tucker searching
cites work: Stochastic Convex Optimization with Bandit Feedback
cites work: On the costs of optimal and near-optimal binary search trees
cites work: Search for point in interval, with high–low feedback
cites work: The theory of search games and rendezvous.
cites work: Q3199181
cites work: Codes: Unequal Probabilities, Unequal Letter Cost
cites work: Delayed binary search, or playing twenty questions with a procrastinator
cites work: Ranking the Best Binary Trees
cites work: Q5521146
cites work: Alphabetic coding with exponential costs
cites work: A High–Low search game on the unit interval
cites work: Q3075109
cites work: 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
cites work: Discrete Search with Directional Information
cites work: Adaptive search over sorted sets
cites work: Letter to the Editor—A Search Problem
cites work: A sorting function
cites work: Query strategies for priced information
cites work: Lopsided trees. I: Analyses
cites work: Bounds for optimalα-β binary trees
cites work: Optimal \(\alpha -\beta\) trees with capacity constraint
cites work: Construction of Optimal $\alpha $-$\beta $ Leaf Trees with Applications to Prefix Code and Information Retrieval
cites work: Economic optimization of off-line inspection procedures with inspection errors
cites work: On the complexity of search algorithms
cites work: The binary identification problem for weighted trees
cites work: Binary search with delayed and missing answers
cites work: Alphabetic Minimax Trees of Degree at Most t
cites work: An exact decomposition algorithm for the generalized knapsack sharing problem
cites work: Efficient algorithms for chemical threshold testing problems
cites work: On binary search trees
cites work: Fibonaccian searching
cites work: A problem of minimax estimation with directional information
cites work: Open Problems on Search Games
cites work: An Asymptotic Solution of Dresher’s Guessing Game
cites work: On the Huffman and alphabetic tree problem with general cost functions
cites work: A New Algorithm for Building Alphabetic Minimax Trees
cites work: A Discrete Search Game
cites work: A Stochastic Search Game
cites work: On Finding the Maximal Range of Validity of a Constrained System
cites work: Global Optimization for Multi-Channel Wireless Data Broadcast with AH-Tree Indexing Scheme
cites work: Isolating a Single Defective Using Group Testing
cites work: A New Algorithm for Minimum Cost Binary Trees
cites work: Alphabetic Minimax Trees in Linear Time
cites work: Optimal Multi-Way Search Trees
cites work: The construction of optimal multiway search trees and the monotonicity principle
cites work: On a problem of optimal search
cites work: Near-Optimal Depth-Constrained Codes
cites work: Q3925820
cites work: A Dichotomous Search for a Geometric Random Variable
cites work: Dichotomous Search for Random Objects on an Interval
cites work: Monotonicity and efficient computation of optimal dichotomous search
cites work: Asymptotic analysis of dichotomous search with search and travel costs
cites work: An optimal algorithm for finding all the jumps of a monotone step-function
cites work: On dichotomous search with direction-dependent costs for a uniformly hidden object
cites work: Isotonicity of minimizers in polychotomous discrete interval search via lattice programming
cites work: Q3953687
cites work: Q4750643
cites work: Sequential transmission using noiseless feedback
cites work: Selection of the optimum uniform partition search
cites work: A New Proof of the T-C Algorithm
cites work: Binary Trees Optimum Under Various Criteria

Operations research applications of dichotomous search (cites work)
cites work: Algorithms – ESA 2005

Operations research applications of dichotomous search (cites work)
cites work: Path Length of Binary Search Trees

Operations research applications of dichotomous search (cites work)
cites work: Optimal Computer Search Trees and Variable-Length Alphabetical Codes

Operations research applications of dichotomous search (cites work)
cites work: Optimal alphabetic trees for binary search

Operations research applications of dichotomous search (cites work)
cites work: Binary Search on a Tape

Operations research applications of dichotomous search (cites work)
cites work: A Method for the Construction of Minimum-Redundancy Codes

Operations research applications of dichotomous search (cites work)
cites work: An asymptotic theory for recurrence relations based on minimization and maximization.

Operations research applications of dichotomous search (cites work)
cites work: Optimal Alphabetic Trees

Operations research applications of dichotomous search (cites work)
cites work: Q5332986

Operations research applications of dichotomous search (cites work)
cites work: Optimum lopsided binary trees

Operations research applications of dichotomous search (cites work)
cites work: Q2934677

Operations research applications of dichotomous search (cites work)
cites work: Parallel minimax search for a maximum

Operations research applications of dichotomous search (cites work)
cites work: Sequential Minimax Search for a Maximum

Operations research applications of dichotomous search (cites work)
cites work: A new proof of the Garsia-Wachs algorithm

Operations research applications of dichotomous search (cites work)
cites work: Alphabetic Minimax Trees

Operations research applications of dichotomous search (cites work)
cites work: Upper and Lower Bounds on Constructing Alphabetic Binary Trees

Operations research applications of dichotomous search (cites work)
cites work: Set Orderings Requiring Costliest Alphabetic Binary Trees

Operations research applications of dichotomous search (cites work)
cites work: Search in an Ordered Array Having Variable Probe Cost

Operations research applications of dichotomous search (cites work)
cites work: Optimum binary search trees

Operations research applications of dichotomous search (cites work)
cites work: Optimal search for rationals

Operations research applications of dichotomous search (cites work)
cites work: On binary searching with nonuniform costs

Operations research applications of dichotomous search (cites work)
cites work: A strategy for searching with different access costs.

Operations research applications of dichotomous search (cites work)
cites work: A subquadratic algorithm for constructing approximately optimal binary search trees

Operations research applications of dichotomous search (cites work)
cites work: A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees

Operations research applications of dichotomous search (cites work)
cites work: A parallel algorithm for optimum height-limited alphabetic binary trees

Operations research applications of dichotomous search (cites work)
cites work: The Optimal Alphabetic Tree Problem Revisited

Operations research applications of dichotomous search (cites work)
cites work: On a generalization of binary search

Operations research applications of dichotomous search (cites work)
cites work: Sequential vs. Binary Batched Searching

Operations research applications of dichotomous search (cites work)
cites work: Maintenance Policies for Stochastically Failing Equipment: A Survey

Operations research applications of dichotomous search (cites work)
cites work: Combinatorial Optimization with Rational Objective Functions

Operations research applications of dichotomous search (cites work)
cites work: A Best Possible Bound for The Weighted Path Length of Binary Search Trees

Operations research applications of dichotomous search (cites work)
cites work: Some Theorems on Sorting

Operations research applications of dichotomous search (cites work)
cites work: Q5181076

Operations research applications of dichotomous search (cites work)
cites work: A DICHOTOMOUS SEARCH WITH TRAVEL COST

Operations research applications of dichotomous search (cites work)
cites work: Optimal binary search trees

Operations research applications of dichotomous search (cites work)
cites work: Bounds on the redundancy of binary alphabetical codes

Operations research applications of dichotomous search (cites work)
cites work: Binary searching with nonuniform costs and its application to text retrieval

Operations research applications of dichotomous search (cites work)
cites work: Binary search trees with binary comparison cost

Operations research applications of dichotomous search (cites work)
cites work: Efficiency of the Fibonacci search method

Operations research applications of dichotomous search (cites work)
cites work: Efficient search for rationals

Operations research applications of dichotomous search (cites work)
cites work: Efficient Generation of Optimal Prefix Code

Operations research applications of dichotomous search (cites work)
cites work: Interpolation search—a log log N search

Operations research applications of dichotomous search (cites work)
cites work: On the query complexity of finding a local maximum point.

Operations research applications of dichotomous search (cites work)
cites work: Rational search

Operations research applications of dichotomous search (cites work)
cites work: Q3204293

Operations research applications of dichotomous search (cites work)
cites work: Interactive High-low Search: The Case of Lost Sales

Operations research applications of dichotomous search (cites work)
cites work: A High-Low Search Algorithm for a Newsboy Problem with Delayed Information Feedback

Operations research applications of dichotomous search (cites work)
cites work: Information and rationality asymmetries in a simple high-low search wage model

Operations research applications of dichotomous search (cites work)
cites work: A dynamic model of collective bargaining

Operations research applications of dichotomous search (cites work)
cites work: Relative impatience determines preference between contract bargaining and repeated bargaining

Operations research applications of dichotomous search (cites work)
cites work: Bounds for Weight Balanced Trees

Operations research applications of dichotomous search (cites work)
cites work: Coping with errors in binary search procedures

Operations research applications of dichotomous search (cites work)
cites work: Interpolation-binary search

Operations research applications of dichotomous search (cites work)
cites work: Product inspection policy for an imperfect production system with inspection errors and warranty cost

Operations research applications of dichotomous search (cites work)
cites work: Trees with exponentially growing costs

Operations research applications of dichotomous search (cites work)
cites work: Optimal maintenance models for systems subject to failure–A Review

Operations research applications of dichotomous search (cites work)
cites work: Economic optimization of off-line inspection with inspection errors

Operations research applications of dichotomous search (cites work)
cites work: Optimum ordered bi-weighted binary trees

Operations research applications of dichotomous search (cites work)
cites work: The optimal binary search tree for Andersson's search algorithm

Operations research applications of dichotomous search (cites work)
cites work: Optimal binary search trees with costs depending on the access paths.

Operations research applications of dichotomous search (cites work)
cites work: Optimal variable length codes (arbitrary symbol cost and equal code word probability)

Operations research applications of dichotomous search (cites work)
cites work: On an efficient dynamic programming technique of F. F. Yao

Operations research applications of dichotomous search (cites work)
cites work: Bisection search with noisy responses

Operations research applications of dichotomous search (cites work)
cites work: Economic off-line quality control strategy with two types of inspection errors

Operations research applications of dichotomous search (cites work)
cites work: Integrated on-line and off-line quality control for products with destructive testing

Operations research applications of dichotomous search (cites work)
cites work: AN OFFLINE INSPECTION AND DISPOSITION MODEL INCORPORATING DISCRETE WEIBULL DISTRIBUTION AND MANUFACTURING VARIATION

Operations research applications of dichotomous search (cites work)
cites work: Utilizing the information theory of entropy to solve an off-line inspection problem

Operations research applications of dichotomous search (cites work)
cites work: On a more general formulation of off-line inspection with inspection errors

Operations research applications of dichotomous search (cites work)
cites work: Economic optimization of off-line inspection with rework consideration

Operations research applications of dichotomous search (cites work)
cites work: Optimal alphabetic search trees with restricted maximal height

Operations research applications of dichotomous search (cites work)
cites work: A Linear Search Problem

Operations research applications of dichotomous search (cites work)
cites work: Speed-Up in Dynamic Programming

Operations research applications of dichotomous search (cites work)
cites work: Q3358643

Operations research applications of dichotomous search (cites work)
cites work: An extended result of Kleitman and Saks concerning binary trees

Operations research applications of dichotomous search (cites work)
cites work: On search over rationals

Operations research applications of dichotomous search (cites work)
cites work: Optimal alphabetic binary tree for a nonregular cost function

Operations research applications of dichotomous search (DOI)
DOI: 10.1016/J.EJOR.2017.07.031

Operations research applications of dichotomous search (Recommended article)
Recommended article: Q4692735
Similarity Score: 0.8844118
Recommender Run: Recommender Run 3

Operations research applications of dichotomous search (Recommended article)
Recommended article: Q3998259
Similarity Score: 0.86392015
Recommender Run: Recommender Run 3

Operations research applications of dichotomous search (Recommended article)
Recommended article: Operations Research Applications
Similarity Score: 0.86348444
Recommender Run: Recommender Run 3

Operations research applications of dichotomous search (Recommended article)
Recommended article: Q5708306
Similarity Score: 0.85940206
Recommender Run: Recommender Run 3

Operations research applications of dichotomous search (Recommended article)
Recommended article: Q4858101
Similarity Score: 0.85833395
Recommender Run: Recommender Run 3

Operations research applications of dichotomous search (Recommended article)
Recommended article: Q5156000
Similarity Score: 0.8564983
Recommender Run: Recommender Run 3

Operations research applications of dichotomous search (Recommended article)
Recommended article: Q3465542
Similarity Score: 0.8564983
Recommender Run: Recommender Run 3

Operations research applications of dichotomous search (Recommended article)
Recommended article: Q4897701
Similarity Score: 0.8564983
Recommender Run: Recommender Run 3

Operations research applications of dichotomous search (Recommended article)
Recommended article: Q3117015
Similarity Score: 0.8564983
Recommender Run: Recommender Run 3