Polynomial algorithms for item matching

To estimate test reliability and to create parallel tests, test items frequently are matched. Items can be matched by splitting tests into parallel test halves, by creating T splits, or by matching a desired test form. Problems often occur. Algorithms are presented to solve these problems. The algorithms are based on optimization theory in networks (graphs) and have polynomial complexity. Computational results from solving sample problems with several hundred decision variables are reported. Index terms: branch-and-bound algorithm, classical test theory, complexity, item matching, non-deterministic polynomial complete, parallel tests, polynomial algorithms, test construction