| Article ID: | iaor19922016 |
| Country: | Australia |
| Volume: | 10 |
| Issue: | 3 |
| Start Page Number: | 22 |
| End Page Number: | 23 |
| Publication Date: | Sep 1991 |
| Journal: | ASOR Bulletin |
| Authors: | Beaumont N.B., Sniedovich Mosche |
| Keywords: | programming: branch and bound |
It is demonstrated that APL2, an especially productive computer language, can be used to quickly code a branch and bound algorithm for the knapsack problem. It is noted that APL2 is available for free.