| Article ID: | iaor20071465 |
| Country: | China |
| Volume: | 14 |
| Issue: | 4 |
| Start Page Number: | 372 |
| End Page Number: | 375 |
| Publication Date: | Aug 2005 |
| Journal: | Systems Engineering Theory & Practice |
| Authors: | Ma Liang, Ning Aibing |
| Keywords: | heuristics |
Based on mathematical inference, this paper proposes a quick reduction algorithm for 0/1-knapsack problem. The algorithm can make certain which items would be in the best solution in batches and which items would not be. The algorithm not only can be used singly, but also can be combined with other heuristic algorithms to get better solutions. Series of examples and instances are solved and analysed.