| Article ID: | iaor1997328 |
| Country: | Netherlands |
| Volume: | 68 |
| Issue: | 3 |
| Start Page Number: | 413 |
| End Page Number: | 421 |
| Publication Date: | Aug 1993 |
| Journal: | European Journal of Operational Research |
| Authors: | Frville Arnaud, Plateau Grard |
| Keywords: | knapsack problem |
The surrogate dual of the 0-1 bidimensional knapsack problem is exactly solved by an algorithm with a modified dichotomic search. The primal (or dual) optimality is proved with a finite number of iterations. A lot of numerical experiments show the efficiency of the present method: its reduced number of iterations is revealed to be independent of the size of the instances.