| Article ID: | iaor19941107 |
| Country: | India |
| Volume: | 30 |
| Issue: | 2 |
| Start Page Number: | 97 |
| End Page Number: | 116 |
| Publication Date: | Jun 1993 |
| Journal: | OPSEARCH |
| Authors: | Pandit S.N.N., Kumar M. Ravi |
| Keywords: | knapsack problem |
An efficient lexicographic search approach to the 0-1 single constraint knapsack problem for the case of strongly correlated (i.e. exactly linearly related) values and weights is presented.