Pages that link to "Item:Q1101237"
From MaRDI portal
The following pages link to A linear time randomizing algorithm for searching ranked functions (Q1101237):
Displaying 9 items.
- An approximate binary search algorithm for the multiple-choice knapsack problem (Q293371) (← links)
- New scaling algorithms for the assignment and minimum mean cycle problems (Q1190599) (← links)
- Mass change detection based on reduced measurements (Q1282184) (← links)
- A new saling algorithm for the maximum mean cut problem (Q1317477) (← links)
- Approximate binary search algorithms for mean cuts and cycles (Q1319679) (← links)
- An algorithm for fractional assignment problems (Q1842662) (← links)
- Approximating the minimum cycle mean (Q2253203) (← links)
- A linear-time algorithm for solving continuous maximin knapsack problems (Q2277359) (← links)
- A Fast Approximation Algorithm For The Subset-Sum Problem (Q4313818) (← links)
