P
Initializing...
pp. 23–24 — the greedy fill ẑ_i(ϵ_i) is optimal for the continuous knapsack (11) and has at most one fractional component · Prove2Me