The following pages link to On search over rationals (Q1170866):
Displaying 6 items.
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems (Q761347) (← links)
- Optimal search for rationals (Q1007565) (← links)
- Operations research applications of dichotomous search (Q1681128) (← links)
- Efficient algorithms for center problems in cactus networks (Q2371802) (← links)
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems (Q2450746) (← links)
- Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)
