{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T00:06:45Z","timestamp":1771459605896,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T00:00:00Z","timestamp":1129593600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2006,3]]},"DOI":"10.1007\/s10589-005-3058-z","type":"journal-article","created":{"date-parts":[[2005,11,21]],"date-time":"2005-11-21T12:25:23Z","timestamp":1132575923000},"page":"319-332","source":"Crossref","is-referenced-by-count":14,"title":["A Constraint Programming Approach to Extract the Maximum Number of Non-Overlapping Test Forms"],"prefix":"10.1007","volume":"33","author":[{"given":"Dmitry I.","family":"Belov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronald D.","family":"Armstrong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,18]]},"reference":[{"key":"3058_CR1","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0377-2217(91)90195-2","volume":"55","author":"J.J. Adema","year":"1991","unstructured":"J.J. Adema, E. Boekkooi-Timminga, and W.J. van der Linden, \u201cAchievement test construction using 0-1 linear programming,\u201d European Journal of Operations Research, vol. 55, pp. 103\u2013111, 1991.","journal-title":"European Journal of Operations Research"},{"key":"3058_CR2","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","volume":"18","author":"E. Balas","year":"1976","unstructured":"E. Balas and M.W. Padberg, \u201cSet partitioning: A survey,\u201d SIAM Review, vol. 18, pp. 710\u2013760, 1976.","journal-title":"SIAM Review"},{"key":"3058_CR3","unstructured":"R. Bartak, \u201cConstraint programming: In pursuit of the holy grail,\u201d in Proceedings of WDS\u201999 (invited lecture), Charles University, Prague, 1999."},{"key":"3058_CR4","doi-asserted-by":"crossref","first-page":"129","DOI":"10.3102\/10769986015002129","volume":"15","author":"E. Boekkooi-Timminga","year":"1990","unstructured":"E. Boekkooi-Timminga, \u201cThe construction of parallel tests from IRT-based item banks,\u201d Journal of Educational Statistics, vol. 15, pp. 129\u2013145, 1990.","journal-title":"Journal of Educational Statistics"},{"key":"3058_CR5","doi-asserted-by":"crossref","unstructured":"I.M. Bomze, M. Budinich, P.M. Pardalos, and M. Pelillo, \u201cThe maximum clique problem,\u201d in Handbook of Combinatorial Optimization (Supplement Volume A), D.-Z. Du and P.M. Pardalos (Eds.), Kluwer Academic Publishers: Boston, MA, 1999.","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"3058_CR6","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s001990050242","volume":"13","author":"P.J. Brewer","year":"1999","unstructured":"P.J. Brewer, \u201cDecentralized computation procurement and computational robustness in a smart market,\u201d Economic Theory, vol. 13, pp. 41\u201392, 1999.","journal-title":"Economic Theory"},{"key":"3058_CR7","unstructured":"C.G. Caplice, \u201cAn optimization based bidding process: A new framework for shipper-carrier relationships,\u201d Thesis in the field of Transportation and Logistics Systems submitted to the Department of Civil and Environmental Engineering, School of Engineering, MIT, 1996."},{"key":"3058_CR8","doi-asserted-by":"crossref","unstructured":"S. de Vries and R. Vohra, \u201cCombinatorial auctions: A survey,\u201d INFORMS J. of Computing, vol. 15, pp. 284\u2013309, 2003.","DOI":"10.1287\/ijoc.15.3.284.16077"},{"key":"3058_CR9","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1287\/inte.33.1.23.12717","volume":"33","author":"A.J. Davenport","year":"2003","unstructured":"A.J. Davenport, C. An, E. Ng, G. Hohner, G. Reid, H. Soo, J.R. Kalagnanam, and J. Rich, \u201cCombinatorial and quantity-discount procurement auctions benefit mars, incorporated and its suppliers,\u201d Interfaces, vol. 33, pp. 23\u201335, 2003.","journal-title":"Interfaces"},{"key":"3058_CR10","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1023\/A:1008720430012","volume":"16","author":"P. Fizzano","year":"2000","unstructured":"P. Fizzano and S. Swanson, \u201cScheduling classes on a college campus,\u201d Computational Optimization and Applications, vol. 16, pp. 279\u2013294, 2000.","journal-title":"Computational Optimization and Applications"},{"key":"3058_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company: New York, NY, 1979."},{"key":"3058_CR12","unstructured":"ILOG, CPLEX 8.0 User's Manual, Incline Village, NV, 2002."},{"key":"3058_CR13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1287\/inte.31.6.29.9647","volume":"31","author":"I.J. Lustig","year":"2001","unstructured":"I.J. Lustig and J.-F. Puget, \u201cProgram does not equal program: constraint programming and its relationship to mathematical programming,\u201d Interfaces, vol. 31, pp. 29\u201353, 2001.","journal-title":"Interfaces"},{"key":"3058_CR14","volume-title":"STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library","author":"D.R. Musser","year":"2001","unstructured":"D.R. Musser, G.J. Derge and A. Saini, STL Tutorial and Reference Guide: C++ Programming with the Standard Template Library, 2nd edition, Addison-Wesley: Boston, MA, 2001.","edition":"2"},{"key":"3058_CR15","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G. Nemhauser","year":"1988","unstructured":"G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons: New York, 1988."},{"key":"3058_CR16","volume-title":"Combinatorial optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou and K. Steiglitz, Combinatorial optimization: Algorithms and Complexity, Englewood Cliffs, Prentice-Hall: New Jersey, 1982."},{"key":"3058_CR17","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/254180.254190","volume":"29","author":"V.T. Paschos","year":"1997","unstructured":"V.T. Paschos, \u201cA survey of approximately optimal solutions to some covering and packing problems,\u201d ACM Computing Surveys, vol. 29, pp. 171\u2013209, 1997.","journal-title":"ACM Computing Surveys"},{"key":"3058_CR18","unstructured":"J.-C. R\u00e9gin, \u201cSolving the maximum clique problem with constraint programming,\u201d CPAIOR'03, http:\/\/www.crt.umontreal.ca\/cpaior\/ , 2003."},{"key":"3058_CR19","unstructured":"T. Sandholm and S. Suri, \u201cImproved algorithms for optimal winner determination in combinatorial auctions and generalizations,\u201d in Proc. of the Seventeen Nat\u2019l Conf. on Artificial Intelligence, pp. 90\u201397, 2000."},{"key":"3058_CR20","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/BF02296260","volume":"50","author":"T.J.J.M. Theunissen","year":"1985","unstructured":"T.J.J.M. Theunissen, \u201cBinary programming and test design,\u201d Psychometrika, vol. 50, pp. 411\u2013420, 1985.","journal-title":"Psychometrika"},{"key":"3058_CR21","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1177\/01466216980223001","volume":"22","author":"W.J. van der Linden","year":"1998","unstructured":"W.J. van der Linden, \u201cOptimal assembly of psychological and educational tests,\u201d Applied Psychological Measurement, vol. 22, pp. 195\u2013211, 1998.","journal-title":"Applied Psychological Measurement"},{"key":"3058_CR22","doi-asserted-by":"crossref","unstructured":"W.J. van der Linden, \u201cOptimal assembly of tests with item sets,\u201d Applied Psychological Measurement, vol. 24, pp. 225\u2013240, 2000.","DOI":"10.1177\/01466210022031697"},{"key":"3058_CR23","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1177\/01466210022031570","volume":"24","author":"W.J. van der Linden","year":"2000","unstructured":"W.J. van der Linden, B.P. Veldkamp, and L.M. Reese, \u201cAn integer programming approach to item pool design,\u201d Applied Psychological Measurement, vol. 24, pp. 139\u2013150, 2000.","journal-title":"Applied Psychological Measurement"},{"key":"3058_CR24","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/S0167-6377(97)00054-0","volume":"21","author":"D. Wood","year":"1997","unstructured":"D. Wood, \u201cAn algorithm for finding a maximum clique in a graph,\u201d Operations Research Letters, vol. 21, pp. 211\u2013217, 1997.","journal-title":"Operations Research Letters"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3058-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-3058-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-3058-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:28Z","timestamp":1559302588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-3058-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,18]]},"references-count":24,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2006,3]]}},"alternative-id":["3058"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-3058-z","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,18]]}}}