Operations research applications of dichotomous search (Q1681128): Difference between revisions

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

Latest revision as of 18:13, 14 July 2024

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

    Statements

    Operations research applications of dichotomous search (English)
    0 references
    0 references
    0 references
    23 November 2017
    0 references
    combinatorial optimization
    0 references
    dichotomous search
    0 references
    alphabetic trees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers