01434nas a2200133   4500008003900000245010800039210006900147300001200216490000700228520097100235100001201206700001901218856006301237       2018                          d00aA Comparison of Constraint Programming and Mixed-Integer Programming for Automated Test-Form Generation0 aComparison of Constraint Programming and MixedInteger Programmin  a435-4560 v553 aAbstract The final step of the typical process of developing educational and psychological tests is to place the selected test items in a formatted form. The step involves the grouping and ordering of the items to meet a variety of formatting constraints. As this activity tends to be time-intensive, the use of mixed-integer programming (MIP) has been proposed to automate it. The goal of this article is to show how constraint programming (CP) can be used as an alternative to automate test-form generation problems with a large variety of formatting constraints, and how it compares with MIP-based form generation as for its models, solutions, and running times. Two empirical examples are presented: (i) automated generation of a computerized fixed-form; and (ii) automated generation of shadow tests for multistage testing. Both examples show that CP works well with feasible solutions and running times likely to be better than that for MIP-based applications.1 aLi, Jie1 aLinden, Wim, J  uhttps://onlinelibrary.wiley.com/doi/abs/10.1111/jedm.12187