News
This paper analyzes a heuristic for the knapsack problem that recursively determines a solution by making a variable with smallest marginal unit cost as large as possible. Recursive necessary and ...
The Journal of the Operational Research Society, Vol. 53, No. 10, Special Issue: Applications and Developments in Mathematical Programming (Oct., 2002), pp. 1109-1117 (9 pages) In the min-max loop ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback