Rational search

DOI10.1016/0020-0190(79)90150-9MaRDI QIDQ1252036zbMATH OpenOpenAlexFDO

Authors Steven P. Reiss

Publication date 1979

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(79)90150-9

zbMATH Keywords

Binary SearchRational Search

Mathematics Subject Classification ID

Linear programming (90C05) Search theory (90B40) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)

Cites work

• scientific article; zbMATH DE number 3303655 (Why is no real title available?)
• scientific article; zbMATH DE number 3191380 (Why is no real title available?)
• Efficient search for rationals
• The complexity of linear programming

Cited in

(13)

• Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
• Optimal search for rationals
• Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches
• Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons
• Continuous bottleneck tree partitioning problems
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems
• Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games
• Bibliography in fractional programming
• A Fourth bibliography of fractional programming
• Searching and encoding for infinite ordered sets
• Operations research applications of dichotomous search
• On search over rationals
• A finite algorithm for the continuousp-center location problem on a graph

This page was built for publication: Rational search

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1252036)