The following pages link to Rational search (Q1252036):
Displaying 13 items.
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems (Q761347) (← links)
- Order statistics in the Farey sequences in sublinear time and counting primitive lattice points in polygons (Q834601) (← links)
- Improved algorithms for the continuous tree edge-partition problems and a note on ratio and sorted matrices searches (Q972328) (← links)
- Optimal search for rationals (Q1007565) (← links)
- On search over rationals (Q1170866) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- Continuous bottleneck tree partitioning problems (Q1827846) (← links)
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems (Q2450746) (← links)
- Optimization problems with algebraic solutions: Quadratic fractional programs and ratio games (Q3688122) (← links)
- A finite algorithm for the continuousp-center location problem on a graph (Q3724065) (← links)
- Searching and encoding for infinite ordered sets (Q3933757) (← links)
- Bibliography in fractional programming (Q3958287) (← links)
- A Fourth bibliography of fractional programming (Q4327876) (← links)
