{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T04:42:16Z","timestamp":1743136936523,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642449727"},{"type":"electronic","value":"9783642449734"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-44973-4_10","type":"book-chapter","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T08:47:05Z","timestamp":1385369225000},"page":"81-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Genetic Algorithm Approach for the Multidimensional Two-Way Number Partitioning Problem"],"prefix":"10.1007","author":[{"given":"P. C.","family":"Pop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"O.","family":"Matei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,26]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/0305-0548(95)E0020-L","volume":"23","author":"MF Arguello","year":"1996","unstructured":"Arguello, M.F., Feo, T.A., Goldschmidt, O.: Randomized methods for the number partitioning problem. Comput. Oper. Res. 23(2), 103\u2013111 (1996)","journal-title":"Comput. Oper. Res."},{"key":"10_CR2","first-page":"65","volume-title":"Metaheuristics: Computer Decision-Making","author":"RE Berretta","year":"2004","unstructured":"Berretta, R.E., Moscato, P., Cotta, C.: Enhancing a memetic algorithms\u2019 performance using a matching-based recombination algorithm: results on the number partitioning problem. In: Resende, M.G.C., Souza, J. (eds.) Metaheuristics: Computer Decision-Making, pp. 65\u201390. Kluwer, Boston (2004)"},{"key":"10_CR3","volume-title":"Probabilistic Analysis of Packing and Partitioning Algorithms","author":"E Coffman","year":"1991","unstructured":"Coffman, E., Lueker, G.S.: Probabilistic Analysis of Packing and Partitioning Algorithms. Wiley, New York (1991)"},{"key":"10_CR4","volume-title":"Computers and Intractability. A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1997","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1997)"},{"key":"10_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Norwell (1997)"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"DS Johnson","year":"1991","unstructured":"Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation. Part II: Graph coloring and number partitioning. Oper. Res. 39(3), 378\u2013406 (1991)","journal-title":"Oper. Res."},{"key":"10_CR7","unstructured":"Karmarkar, N., Karp, R.M.: The differencing method of set partitioning, Technical report UCB\/CSD 82\/113, University of California, Berkeley, Computer Science Division (1982)"},{"key":"10_CR8","doi-asserted-by":"publisher","first-page":"2302","DOI":"10.1016\/j.camwa.2010.08.024","volume":"60","author":"J Kojic","year":"2010","unstructured":"Kojic, J.: Integer linear programming model for multidimensional two-way number partitioning problem. Comput. Math. Appl. 60, 2302\u20132308 (2010)","journal-title":"Comput. Math. Appl."},{"issue":"2","key":"10_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF02192530","volume":"89","author":"W Ruml","year":"1996","unstructured":"Ruml, W., Ngo, J.T., Marks, J., Shieber, S.M.: Easily searched encodings for number partitioning. J. Optim. Theor. Appl. 89(2), 251\u2013291 (1996)","journal-title":"J. Optim. Theor. Appl."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-44973-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T19:51:33Z","timestamp":1676836293000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-44973-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642449727","9783642449734"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-44973-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"26 November 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}