| Article ID: | iaor19981462 |
| Country: | Netherlands |
| Volume: | 80 |
| Issue: | 2 |
| Start Page Number: | 446 |
| End Page Number: | 450 |
| Publication Date: | Jan 1995 |
| Journal: | European Journal of Operational Research |
| Authors: | Kovalev M.M., Vasilkov D.M. |
| Keywords: | knapsack problem |
Using the isotone property with respect to the canonical order, we describe a class of objective functions and a class of polyhedral feasible sets which provide the optimal greedy solution for the problem max{