Optimal sequential designs for on-line item estimation
Year of publication: |
1994
|
---|---|
Authors: | Jones, Douglas ; Jin, Zhiying |
Published in: |
Psychometrika. - Springer. - Vol. 59.1994, 1, p. 59-75
|
Publisher: |
Springer |
Subject: | branch-and-bound | computerized adaptive test | exactn-pointD-optimal | integer programming | item response theory | measurement errors model | on-line testing | sequential design |
-
Branch-and-bound for bi-objective integer programming
Parragh, Sophie N., (2019)
-
A branch-and-bound algorithm for the acyclic partitioning problem
Nossack, Jenny, (2014)
-
Improving strong branching by domain propagation
Gamrath, Gerald, (2014)
- More ...
-
ARTICLES - An O(nm)-Time Network Simplex Algorithm for the Shortest Path Problem
Goldfarb, Donald, (1999)
-
Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem
Goldfarb, Donald, (1997)
-
A Faster Combinatorial Algorithm for the Generalized Circulation Problem
Goldfarb, Donald, (1996)
- More ...