Skip to main content
Polynomial algorithms for item matching
Armstrong, Ronald D.; Jones, Douglas H. (1992)
 

Title 
Polynomial algorithms for item matching

Issue Date
1992

Type
Article

Abstract
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.

Appears in Collection(s)

Other Identifier(s)
other: doi:10.1177/014662169201600408

Suggested Citation
Armstrong, Ronald D.; Jones, Douglas H.. (1992). Polynomial algorithms for item matching. Retrieved from the University of Minnesota Digital Conservancy, http://purl.umn.edu/116160.


Content distributed via the University of Minnesota's Digital Conservancy may be subject to additional license and use restrictions applied by the depositor.