Pages that link to "Item:Q4190436"
From MaRDI portal
The following pages link to A Fast Selection Algorithm and the Problem of Optimum Distribution of Effort (Q4190436):
Displayed 16 items.
- A faster algorithm for the resource allocation problem with convex cost functions (Q491166) (← links)
- An algorithm for a separable integer programming problem with cumulatively bounded variables (Q579126) (← links)
- Discrete resource allocation with tree constraints by an incremental method (Q799478) (← links)
- An efficient algorithm for the parametric resource allocation problem (Q1058467) (← links)
- L-infinity interdistance selection by parametric search (Q1115620) (← links)
- The complexity of selection and ranking in X+Y and matrices with sorted columns (Q1161291) (← links)
- On a general network location--production--allocation problem (Q1183612) (← links)
- Optimal binary trees with order constraints (Q1283811) (← links)
- Algorithms for the item assortment problem: an application to vending machine products (Q1394572) (← links)
- Fast integer-valued algorithms for optimal allocations under constraints in stratified sampling (Q1663138) (← links)
- Fair and efficient allocation with few agent types, few item types, or small value levels (Q2680786) (← links)
- Linear-Time Algorithms for Proportional Apportionment (Q2942662) (← links)
- The Maximum Coverage Location Problem (Q3661269) (← links)
- An $O ( ( n\log p )^2 )$ Algorithm for the Continuous <i>p</i>-Center Problem on a Tree (Q3960131) (← links)
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (Q5085487) (← links)
- A polynomial algorithm for resourse allocation problems with polymatroid constrains<sup>1</sup> (Q5689829) (← links)