{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T00:09:34Z","timestamp":1782518974014,"version":"3.54.5"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Promotion of Science Grants-in-Aid for Scientific Research","award":["JP19H05663"],"award-info":[{"award-number":["JP19H05663"]}]},{"name":"Promotion of Science Grants-in-Aid for Scientific Research","award":["JP19K21751"],"award-info":[{"award-number":["JP19K21751"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Learning Technol."],"published-print":{"date-parts":[[2022,4,1]]},"DOI":"10.1109\/tlt.2022.3163360","type":"journal-article","created":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:50:35Z","timestamp":1648669835000},"page":"252-264","source":"Crossref","is-referenced-by-count":10,"title":["Hybrid Maximum Clique Algorithm Using Parallel Integer Programming for Uniform Test Assembly"],"prefix":"10.1109","volume":"15","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2941-826X","authenticated-orcid":false,"given":"Kazuma","family":"Fuchimoto","sequence":"first","affiliation":[{"name":"University of Electro-Communications, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1019-7161","authenticated-orcid":false,"given":"Takatoshi","family":"Ishii","sequence":"additional","affiliation":[{"name":"Sundai Institute of AI for Education, SATT Company Ltd., Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3598-8867","authenticated-orcid":false,"given":"Maomi","family":"Ueno","sequence":"additional","affiliation":[{"name":"University of Electro-Communications, Tokyo, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-020-00602-z"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2015.07.013"},{"key":"ref33","author":"lord","year":"1968","journal-title":"Statistical Theories of Mental Test Scores"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39817-4_21"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-005-3058-z"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.01.057"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2017.02.017"},{"key":"ref36","article-title":"Implementations of the branch-and-bound method for test construction problems","author":"ameda","year":"1989"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/BF02294518"},{"key":"ref34","author":"baker","year":"2004","journal-title":"Item Response Theory Parameter Estimation Techniques (Statistics A Series of Textbooks and Monographs)"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90195-2"},{"key":"ref40","first-page":"15","article-title":"An $o(2^{0.19171n})$-time and polynomial-space algorithm for finding a maximum clique","author":"nakanishi","year":"2008","journal-title":"Journal of Information Processing Society"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1177\/014662169201600106"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1177\/014662169301700205"},{"key":"ref13","first-page":"195","article-title":"A comparison of pair-wise and group selections of items using simulated annealing in automated construction of parallel tests","volume":"44","author":"jeng","year":"1997","journal-title":"Psychological Testing"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/01466216980223003"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1111\/j.1745-3984.1998.tb00533.x"},{"key":"ref16","article-title":"A review of linear programming and its application to the assessment tools for teaching and learning (as TTLE) projects","author":"fletcher","year":"2000"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TE.2002.858405"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1080\/08957340801926151"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TLT.2010.29"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1177\/01466216980223004"},{"key":"ref4","author":"linden","year":"1986","journal-title":"A Zero-One Programming Approach to Gulliksen's Matched Random Subtest Method (series Project Psychometrische Aspecten Van Item Banking)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.3102\/10769986019001073"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1177\/014662168601000406"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1177\/014662168801200208"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-011-0308-x"},{"key":"ref5","first-page":"101","article-title":"Simultaneous test construction by zero-one programming","volume":"1","author":"boekkooi-timminga","year":"1987","journal-title":"Methodika"},{"key":"ref8","first-page":"1","article-title":"An alternative methodology for creating parallel test forms using the IRT information function","author":"ackerman","year":"0","journal-title":"Proc Annu Meeting Nat Council Meas Educ"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.3102\/10769986014003279","article-title":"Algorithms for computerized test construction using classical item parameters","volume":"14","author":"ameda","year":"1989","journal-title":"J Educ Statist"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02296260"},{"key":"ref9","article-title":"Models and algorithms for the construction of achievement tests","author":"ameda","year":"1990"},{"key":"ref1","author":"lord","year":"1980","journal-title":"Applications of Item Response Theory to Practical Testing Problems"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-19773-9_80"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39112-5_46"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.3102\/10769986025002203"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TLT.2012.22"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-61425-0_9"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TLT.2013.2297694"},{"key":"ref42","year":"0"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/JCSSE53117.2021.9493810"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s11336-007-9025-0"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s41237-021-00143-x"},{"key":"ref44","first-page":"47","article-title":"An approximate maximum clique algorithm using integer programming","volume":"100","author":"ishii","year":"2017","journal-title":"IEICE Trans Inf Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.3102\/10769986015002129"},{"key":"ref43","article-title":"ILOG CPLEX Optimization Studio CPLEX User's Manual 12.9","year":"2019"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29054-0"}],"container-title":["IEEE Transactions on Learning Technologies"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4620076\/9802796\/09745471.pdf?arnumber=9745471","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T19:46:55Z","timestamp":1657568815000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9745471\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,1]]},"references-count":47,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tlt.2022.3163360","relation":{},"ISSN":["1939-1382","2372-0050"],"issn-type":[{"value":"1939-1382","type":"electronic"},{"value":"2372-0050","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,1]]}}}