{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T05:49:59Z","timestamp":1774331399031,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,7,3]],"date-time":"2012-07-03T00:00:00Z","timestamp":1341273600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10479-012-1175-5","type":"journal-article","created":{"date-parts":[[2012,7,2]],"date-time":"2012-07-02T14:40:48Z","timestamp":1341240048000},"page":"611-626","source":"Crossref","is-referenced-by-count":9,"title":["Exact and approximate methods for a one-dimensional minimax bin-packing problem"],"prefix":"10.1007","volume":"206","author":[{"given":"Michael J.","family":"Brusco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans Friedrich","family":"K\u00f6hn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas","family":"Steinley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,7,3]]},"reference":[{"key":"1175_CR1","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1177\/014662169201600106","volume":"16","author":"J. J. Adema","year":"1992","unstructured":"Adema, J. J. (1992). Methods and models for the construction of weakly parallel tests. Applied Psychological Measurement, 16, 53\u201363.","journal-title":"Applied Psychological Measurement"},{"key":"1175_CR2","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/opre.42.2.287","volume":"42","author":"S. Anily","year":"1984","unstructured":"Anily, S., Bramel, J., & Simchi-Levi, D. (1984). Worst-case analysis of heuristics for the bin-packing problem with general cost structures. Operations Research, 42, 287\u2013298.","journal-title":"Operations Research"},{"key":"1175_CR3","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1177\/014662169201600408","volume":"16","author":"R. D. Armstrong","year":"1992","unstructured":"Armstrong, R. D., & Jones, D. H. (1992). Polynomial algorithms for item matching. Applied Psychological Measurement, 16, 365\u2013373.","journal-title":"Applied Psychological Measurement"},{"key":"1175_CR4","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1057\/palgrave.jors.2601307","volume":"53","author":"K. R. Baker","year":"2002","unstructured":"Baker, K. R., & Powell, S. G. (2002). Methods for assigning students to groups: a study of alternate objective functions. Journal of the Operational Research Society, 53, 397\u2013404.","journal-title":"Journal of the Operational Research Society"},{"key":"1175_CR5","volume-title":"Branch-and-bound applications in combinatorial data analysis","author":"M. J. Brusco","year":"2005","unstructured":"Brusco, M. J., & Stahl, S. (2005). Branch-and-bound applications in combinatorial data analysis. New York: Springer."},{"key":"1175_CR6","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1057\/palgrave.jors.2600356","volume":"48","author":"M. J. Brusco","year":"1997","unstructured":"Brusco, M. J., Thompson, G. M., & Jacobs, L. W. (1997). A morph-based simulated annealing heuristic for a modified bin-packing problem. Journal of the Operational Research Society, 48, 433\u2013439.","journal-title":"Journal of the Operational Research Society"},{"key":"1175_CR7","first-page":"46","volume-title":"Approximation algorithms for NP-hard problems","author":"E. G. Coffman","year":"1997","unstructured":"Coffman, E. G., Garey, M. R., & Johnson, D. S. (1997). Approximation algorithms for bin packing: A survey. In D. Hochbaum (Ed.), Approximation algorithms for NP-hard problems (pp. 46\u201393), Boston: PWS Publishing."},{"key":"1175_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1120582.1120583","volume":"53","author":"J. Csirik","year":"2006","unstructured":"Csirik, J., Johnson, D. S., Kenyon, C., Orlin, J. B., Shor, P. W., & Weber, R. R. (2006). On the sum-of-squares algorithm for bin packing. Journal of the ACM, 53, 1\u201365.","journal-title":"Journal of the ACM"},{"key":"1175_CR9","unstructured":"Dash Optimization, Ltd. (2001\u20132007). Modeling with Xpress-MP. http:\/\/www.dashoptimization.com\/home\/downloads\/pdf\/Modeling_with_Xpress-MP.pdf ."},{"key":"1175_CR10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/ijoc.7.2.191","volume":"7","author":"M. Dell\u2019Amico","year":"1995","unstructured":"Dell\u2019Amico, M., & Martello, S. (1995). Optimal scheduling of tasks on identical parallel processors. Informs Journal on Computing, 7, 191\u2013200.","journal-title":"Informs Journal on Computing"},{"key":"1175_CR11","doi-asserted-by":"crossref","first-page":"821","DOI":"10.1016\/S0305-0548(00)00082-4","volume":"29","author":"K. Fleszar","year":"2002","unstructured":"Fleszar, K., & Hindi, K. S. (2002). New heuristics for one-dimensional bin-packing. Computers & Operations Research, 29, 821\u2013839.","journal-title":"Computers & Operations Research"},{"key":"1175_CR12","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0305-0548(88)90009-3","volume":"15","author":"N. G. Hall","year":"1988","unstructured":"Hall, N. G., Ghosh, S., Kankey, R. D., Narasimhan, S., & Rhee, W. T. (1988). Bin-packing problems in one dimension: heuristic solutions and confidence intervals. Computers & Operations Research, 15, 171\u2013177.","journal-title":"Computers & Operations Research"},{"key":"1175_CR13","unstructured":"ILOG Inc. (2009). CPLEX 12.1, http:\/\/www.ilog.com\/products\/cplex\/news\/whatsnew.cfm ."},{"key":"1175_CR14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0203025","volume":"3","author":"D. S. Johnson","year":"1974","unstructured":"Johnson, D. S., Garey, M. R., Graham, R. L., Demers, A., & Ullman, D. (1974). Worst-case performance bounds for simple one dimensional packing algorithms. SIAM Journal on Computing, 3, 299\u2013325.","journal-title":"SIAM Journal on Computing"},{"key":"1175_CR15","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF02283751","volume":"16","author":"T. K\u00e4mpke","year":"1988","unstructured":"K\u00e4mpke, T. (1988). Simulated annealing: use of a new tool in bin packing. Annals of Operations Research, 16, 327\u2013332.","journal-title":"Annals of Operations Research"},{"key":"1175_CR16","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, 671\u2013680.","journal-title":"Science"},{"key":"1175_CR17","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1002\/1520-6750(199106)38:3<447::AID-NAV3220380312>3.0.CO;2-0","volume":"38","author":"G. Klein","year":"1991","unstructured":"Klein, G., & Aronson, J. E. (1991). Optimal clustering: a model and method. Naval Research Logistics, 38, 447\u2013461.","journal-title":"Naval Research Logistics"},{"key":"1175_CR18","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1080\/01621459.1971.10482319","volume":"66","author":"M. R. Rao","year":"1971","unstructured":"Rao, M. R. (1971). Cluster analysis and mathematical programming. Journal of the American Statistical Association, 66, 622\u2013626.","journal-title":"Journal of the American Statistical Association"},{"key":"1175_CR19","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0898-1221(94)90077-9","volume":"27","author":"R. L. Rao","year":"1994","unstructured":"Rao, R. L., & Iyengar, S. S. (1994). Bin-packing by simulated annealing. Computers and Mathematics with Applications, 27, 71\u201382.","journal-title":"Computers and Mathematics with Applications"},{"key":"1175_CR20","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF00127358","volume":"2","author":"A. Scholl","year":"1996","unstructured":"Scholl, A., & Voss, S. (1996). Simple assembly line balancing\u2014heuristic approaches. Journal of Heuristics, 2, 217\u2013244.","journal-title":"Journal of Heuristics"},{"key":"1175_CR21","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/BF02293734","volume":"46","author":"W. J. Linden van der","year":"1981","unstructured":"van der Linden, W. J. (1981). Using aptitude measurements for the optimal assignment of subjects to treatments with and without mastery scores. Psychometrika, 46, 257\u2013274.","journal-title":"Psychometrika"},{"key":"1175_CR22","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1177\/01466216980223001","volume":"22","author":"W. J. Linden van der","year":"1998","unstructured":"van der Linden, W. J. (1998). Optimal assembly of psychological and educational tests. Applied Psychological Measurement, 22, 195\u2013211.","journal-title":"Applied Psychological Measurement"},{"key":"1175_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/0-387-29054-0","volume-title":"Linear models for optimal test design","author":"W. J. Linden van der","year":"2005","unstructured":"van der Linden, W. J. (2005). Linear models for optimal test design. New York: Springer."},{"key":"1175_CR24","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1177\/014662168801200210","volume":"12","author":"W. J. Linden van der","year":"1988","unstructured":"van der Linden, W. J., & Boekkooi-Timminga, E. (1988). A zero-one programming approach to Gulliksen\u2019s matched random subtests method. Applied Psychological Measurement, 12, 201\u2013209.","journal-title":"Applied Psychological Measurement"},{"key":"1175_CR25","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF02294518","volume":"54","author":"W. J. Linden van der","year":"1989","unstructured":"van der Linden, W. J., & Boekkooi-Timminga, E. (1989). A maximin model for test design with practical constraints. Psychometrika, 54, 237\u2013247.","journal-title":"Psychometrika"},{"key":"1175_CR26","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1111\/j.1745-3984.1999.tb00557.x","volume":"36","author":"B. P. Veldkamp","year":"1999","unstructured":"Veldkamp, B. P. (1999). Multiple objective test assembly problems. Journal of Educational Measurement, 36, 253\u2013266.","journal-title":"Journal of Educational Measurement"},{"key":"1175_CR27","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1016\/B0-12-369398-5\/00447-3","volume-title":"Encyclopedia of social measurement","author":"B. P. Veldkamp","year":"2005","unstructured":"Veldkamp, B. P. (2005). Optimal test construction. In K. Kempf-Leonard (Ed.), Encyclopedia of social measurement (Vol. 2, pp. 933\u2013941). San Diego: Academic Press."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1175-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1175-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1175-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:36Z","timestamp":1559153376000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1175-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,3]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["1175"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1175-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,3]]}}}