Operations research applications of dichotomous search (Q1681128)

From MaRDI portal

Revision as of 18:13, 14 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Operations research applications of dichotomous search	scientific article

Statements

scholarly article

0 references

Operations research applications of dichotomous search (English)

0 references

0 references

0 references

European Journal of Operational Research

0 references

publication date

23 November 2017

0 references

zbMATH Keywords

combinatorial optimization

0 references

dichotomous search

0 references

alphabetic trees

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejor.2017.07.031

0 references

A minmax search for the critical level of a system: The asymmetric case

0 references

Parallelized Huffman and Hu-Tucker searching

0 references

Stochastic Convex Optimization with Bandit Feedback

0 references

On the costs of optimal and near-optimal binary search trees

0 references

Search for point in interval, with high–low feedback

0 references

The theory of search games and rendezvous.

0 references

0 references

Codes: Unequal Probabilities, Unequal Letter Cost

0 references

Delayed binary search, or playing twenty questions with a procrastinator

0 references

Ranking the Best Binary Trees

0 references

0 references

Alphabetic coding with exponential costs

0 references

A High–Low search game on the unit interval

0 references

0 references

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

0 references

Discrete Search with Directional Information

0 references

Adaptive search over sorted sets

0 references

Letter to the Editor—A Search Problem

0 references

A sorting function

0 references

Query strategies for priced information

0 references

Lopsided trees. I: Analyses

0 references

Bounds for optimalα-β binary trees

0 references

Optimal \(\alpha -\beta\) trees with capacity constraint

0 references

Construction of Optimal $\alpha $-$\beta $ Leaf Trees with Applications to Prefix Code and Information Retrieval

0 references

Economic optimization of off-line inspection procedures with inspection errors

0 references

On the complexity of search algorithms

0 references

The binary identification problem for weighted trees

0 references

Binary search with delayed and missing answers

0 references

Alphabetic Minimax Trees of Degree at Most <i>t</i>

0 references

An exact decomposition algorithm for the generalized knapsack sharing problem

0 references

Efficient algorithms for chemical threshold testing problems

0 references

On binary search trees

0 references

Fibonaccian searching

0 references

A problem of minimax estimation with directional information

0 references

Open Problems on Search Games

0 references

An Asymptotic Solution of Dresher’s Guessing Game

0 references

On the Huffman and alphabetic tree problem with general cost functions

0 references

A New Algorithm for Building Alphabetic Minimax Trees

0 references

A Discrete Search Game

0 references

A Stochastic Search Game

0 references

On Finding the Maximal Range of Validity of a Constrained System

0 references

Global Optimization for Multi-Channel Wireless Data Broadcast with AH-Tree Indexing Scheme

0 references

Isolating a Single Defective Using Group Testing

0 references

A New Algorithm for Minimum Cost Binary Trees

0 references

Alphabetic Minimax Trees in Linear Time

0 references

Optimal Multi-Way Search Trees

0 references

The construction of optimal multiway search trees and the monotonicity principle

0 references

On a problem of optimal search

0 references

Near-Optimal Depth-Constrained Codes

0 references

0 references

A Dichotomous Search for a Geometric Random Variable

0 references

Dichotomous Search for Random Objects on an Interval

0 references

Monotonicity and efficient computation of optimal dichotomous search

0 references

Asymptotic analysis of dichotomous search with search and travel costs

0 references

An optimal algorithm for finding all the jumps of a monotone step-function

0 references

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

0 references

Isotonicity of minimizers in polychotomous discrete interval search via lattice programming

0 references

0 references

0 references

Sequential transmission using noiseless feedback

0 references

Selection of the optimum uniform partition search

0 references

A New Proof of the T-C Algorithm

0 references

Binary Trees Optimum Under Various Criteria

0 references

Algorithms – ESA 2005

0 references

Path Length of Binary Search Trees

0 references

Optimal Computer Search Trees and Variable-Length Alphabetical Codes

0 references

Optimal alphabetic trees for binary search

0 references

Binary Search on a Tape

0 references

A Method for the Construction of Minimum-Redundancy Codes

0 references

An asymptotic theory for recurrence relations based on minimization and maximization.

0 references

Optimal Alphabetic Trees

0 references

0 references

Optimum lopsided binary trees

0 references

0 references

Parallel minimax search for a maximum

0 references

Sequential Minimax Search for a Maximum

0 references

A new proof of the Garsia-Wachs algorithm

0 references

Alphabetic Minimax Trees

0 references

Upper and Lower Bounds on Constructing Alphabetic Binary Trees

0 references

Set Orderings Requiring Costliest Alphabetic Binary Trees

0 references

Search in an Ordered Array Having Variable Probe Cost

0 references

Optimum binary search trees

0 references

Optimal search for rationals

0 references

On Binary Searching with Nonuniform Costs

0 references

A strategy for searching with different access costs.

0 references

A subquadratic algorithm for constructing approximately optimal binary search trees

0 references

A Fast Algorithm For Optimum Height-Limited Alphabetic Binary Trees

0 references

A parallel algorithm for optimum height-limited alphabetic binary trees

0 references

The Optimal Alphabetic Tree Problem Revisited

0 references

On a generalization of binary search

0 references

Sequential vs. Binary Batched Searching

0 references

Maintenance Policies for Stochastically Failing Equipment: A Survey

0 references

Combinatorial Optimization with Rational Objective Functions

0 references

A Best Possible Bound for The Weighted Path Length of Binary Search Trees

0 references

Some Theorems on Sorting

0 references

0 references

A DICHOTOMOUS SEARCH WITH TRAVEL COST

0 references

Optimal binary search trees

0 references

Bounds on the redundancy of binary alphabetical codes

0 references

Binary searching with nonuniform costs and its application to text retrieval

0 references

Binary search trees with binary comparison cost

0 references

Efficiency of the Fibonacci search method

0 references

Efficient search for rationals

0 references

Efficient Generation of Optimal Prefix Code

0 references

Interpolation search—a log log <i>N</i> search

0 references

On the query complexity of finding a local maximum point.

0 references

Rational search

0 references

0 references

Interactive High-low Search: The Case of Lost Sales

0 references

A High-Low Search Algorithm for a Newsboy Problem with Delayed Information Feedback

0 references

Information and rationality asymmetries in a simple high-low search wage model

0 references

A dynamic model of collective bargaining

0 references

Relative impatience determines preference between contract bargaining and repeated bargaining

0 references

Bounds for Weight Balanced Trees

0 references

Coping with errors in binary search procedures

0 references

Interpolation-binary search

0 references

Product inspection policy for an imperfect production system with inspection errors and warranty cost

0 references

Trees with exponentially growing costs

0 references

Optimal maintenance models for systems subject to failure–A Review

0 references

Economic optimization of off-line inspection with inspection errors

0 references

Optimum ordered bi-weighted binary trees

0 references

The optimal binary search tree for Andersson's search algorithm

0 references

Optimal binary search trees with costs depending on the access paths.

0 references

Optimal variable length codes (arbitrary symbol cost and equal code word probability)

0 references

On an efficient dynamic programming technique of F. F. Yao

0 references

Bisection Search with Noisy Responses

0 references

Economic off-line quality control strategy with two types of inspection errors

0 references

Integrated on-line and off-line quality control for products with destructive testing

0 references

AN OFFLINE INSPECTION AND DISPOSITION MODEL INCORPORATING DISCRETE WEIBULL DISTRIBUTION AND MANUFACTURING VARIATION

0 references

Utilizing the information theory of entropy to solve an off-line inspection problem

0 references

On a more general formulation of off-line inspection with inspection errors

0 references

Economic optimization of off-line inspection with rework consideration

0 references

Optimal alphabetic search trees with restricted maximal height

0 references

A Linear Search Problem

0 references

Speed-Up in Dynamic Programming

0 references

0 references

An extended result of Kleitman and Saks concerning binary trees

0 references

On search over rationals

0 references

Optimal alphabetic binary tree for a nonregular cost function

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ejor.2017.07.031

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1681128

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1681128&oldid=36358644"