DSpace DSpace

University of Minnesota Digital Conservancy >
University of Minnesota - Twin Cities >
Applied Psychological Measurement >
Volume 16, 1992 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/11299/116160

Title: Polynomial algorithms for item matching
Authors: Armstrong, Ronald D.
Jones, Douglas H.
Issue Date: 1992
Citation: Armstrong, Ronald D & Jones, Douglas H. (1992). Polynomial algorithms for item matching. Applied Psychological Measurement, 16, 365-371. doi:10.1177/014662169201600408
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.
URI: http://purl.umn.edu/116160
Appears in Collections:Volume 16, 1992

Files in This Item:

File Description SizeFormat
v16n4p365.pdf708.79 kBPDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.