Article ID: | iaor20062905 |
Country: | Netherlands |
Volume: | 33 |
Issue: | 2/3 |
Start Page Number: | 319 |
End Page Number: | 332 |
Publication Date: | Mar 2006 |
Journal: | Computational Optimization and Applications |
Authors: | Armstrong Ronald D., Belov Dmitry I. |
Keywords: | sets |
This paper introduces a novel approach for extracting the maximum number of non-overlapping test forms from a large collection of overlapping test sections assembled from a given item bank. The approach involves solving maximum set packing problems (MSPs). A branch-and-bound MSP algorithm is developed along with techniques adapted from constraint programming to estimate lower and upper bounds on the optimal MSP solution. The algorithm is general and can be applied in other applications including combinatorial auctions. The results of computer simulations and experiments with an operational item bank are presented.