A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms

Authors:
Dmitry I. Belov;Ronald D. Armstrong
Affiliations:
Psychometric Research, Law School Admission Council, Newtown, USA 18940;Rutgers, The State University of New Jersey, Newark, USA 07102-1895
Venue:
Computational Optimization and Applications
Year:
2006

Citing 11
Cited 1

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Integer and combinatorial optimization

Integer and combinatorial optimization
A survey of approximately optimal solutions to some covering and packing problems

ACM Computing Surveys (CSUR)
Scheduling Classes on a College Campus

Computational Optimization and Applications
STL tutorial and reference guide, second edition: C++ programming with the standard template library

STL tutorial and reference guide, second edition: C++ programming with the standard template library
Program Does Not Equal Program: Constraint Programming and Its Relationship to Mathematical Programming

Interfaces
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Improved Algorithms for Optimal Winner Determination in Combinatorial Auctions and Generalizations

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Combinatorial and Quantity-Discount Procurement Auctions Benefit Mars, Incorporated and Its Suppliers

Interfaces
Combinatorial Auctions: A Survey

INFORMS Journal on Computing
An algorithm for finding a maximum clique in a graph

Operations Research Letters

Supply chain for a high stakes testing agency

ISP'07 Proceedings of the 6th WSEAS international conference on Information security and privacy

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.