{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T02:57:32Z","timestamp":1764212252009,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,3,26]],"date-time":"2022-03-26T00:00:00Z","timestamp":1648252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,26]],"date-time":"2022-03-26T00:00:00Z","timestamp":1648252800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["W1260-N35"],"award-info":[{"award-number":["W1260-N35"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s40314-022-01825-2","type":"journal-article","created":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:03:54Z","timestamp":1648512234000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["New mixed-integer linear programming model for solving the multidimensional multi-way number partitioning problem"],"prefix":"10.1007","volume":"41","author":[{"given":"Bojan","family":"Nikolic","sequence":"first","affiliation":[]},{"given":"Marko","family":"Djukanovic","sequence":"additional","affiliation":[]},{"given":"Dragan","family":"Matic","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,26]]},"reference":[{"key":"1825_CR1","volume-title":"Probabilistic analysis of packing and partitioning algorithms","author":"EG Coffman","year":"1991","unstructured":"Coffman EG, Lueker GS (1991) Probabilistic analysis of packing and partitioning algorithms. Wiley, Amsterdam"},{"key":"1825_CR2","doi-asserted-by":"crossref","unstructured":"Faria AF, de\u00a0Souza SR, de\u00a0S\u00e1 EM (2020) A mixed-integer linear programming model to solve the multidimensional multi-way number partitioning problem. Comput Oper Res 127:105133","DOI":"10.1016\/j.cor.2020.105133"},{"issue":"3","key":"1825_CR3","first-page":"17","volume":"58","author":"L Fuksz","year":"2013","unstructured":"Fuksz L, Pop P, Zelina I (2013) Heuristic algorithms for solving the bi-dimensional two-way number partitioning problem. Stud Univ Babes-Bolyai Ser Inf 58(3):17\u201328","journal-title":"Stud Univ Babes-Bolyai Ser Inf"},{"issue":"12","key":"1825_CR4","doi-asserted-by":"publisher","first-page":"7499","DOI":"10.1007\/s13369-018-3155-9","volume":"43","author":"M Hacibeyoglu","year":"2018","unstructured":"Hacibeyoglu M, Alaykiran K, Acilar AM, Tongur V, Ulker E (2018) A comparative analysis of metaheuristic approaches for multidimensional two-way number partitioning problem. Arab J Sci Eng 43(12):7499\u20137520","journal-title":"Arab J Sci Eng"},{"key":"1825_CR5","doi-asserted-by":"crossref","unstructured":"Hacibeyoglu M, Tongur V, Alaykiran K (2014) Solving the bi-dimensional two-way number partitioning problem with heuristic algorithms. In: 2014 IEEE 8th international conference on application of information and communication technologies (AICT), pp 1\u20135, IEEE","DOI":"10.1109\/ICAICT.2014.7035916"},{"issue":"2","key":"1825_CR6","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1511\/2002.2.113","volume":"90","author":"B Hayes","year":"2002","unstructured":"Hayes B (2002) Computing science: the easiest hard problem. Am Sci 90(2):113\u2013117","journal-title":"Am Sci"},{"issue":"1","key":"1825_CR7","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1002\/net.1975.5.1.45","volume":"5","author":"RM Karp","year":"1975","unstructured":"Karp RM (1975) On the computational complexity of combinatorial problems. Networks 5(1):45\u201368","journal-title":"Networks"},{"issue":"8","key":"1825_CR8","doi-asserted-by":"publisher","first-page":"2302","DOI":"10.1016\/j.camwa.2010.08.024","volume":"60","author":"J Koji\u0107","year":"2010","unstructured":"Koji\u0107 J (2010) Integer linear programming model for multidimensional two-way number partitioning problem. Comput Math Appl 60(8):2302\u20132308","journal-title":"Comput Math Appl"},{"key":"1825_CR9","first-page":"538","volume":"9","author":"RE Korf","year":"2009","unstructured":"Korf RE (2009) Multi-way number partitioning. IJCAI 9:538\u2013543","journal-title":"IJCAI"},{"key":"1825_CR10","unstructured":"Korf, RE, Schreiber, EL, Moffitt MD (2014) Optimal sequential multi-way number partitioning. In: ISAIM"},{"key":"1825_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.cor.2014.01.003","volume":"46","author":"J Kratica","year":"2014","unstructured":"Kratica J, Koji\u0107 J, Savi\u0107 A (2014) Two metaheuristic approaches for solving multidimensional two-way number partitioning problem. Comput Oper Res 46:59\u201368","journal-title":"Comput Oper Res"},{"key":"1825_CR12","doi-asserted-by":"crossref","unstructured":"Ercegovac DM, Potkonjak M (1999) Low-power behavioral synthesis optimization using multiple precision arithmetic. In: Proceedings of the 36th annual ACM\/IEEE design automation conference, pp 568\u2013573. Association for Computing Machinery","DOI":"10.1145\/309847.310000"},{"issue":"2","key":"1825_CR13","first-page":"125","volume":"125","author":"S Mertens","year":"2006","unstructured":"Mertens S (2006) The easiest hard problem: number partitioning. Comput Complex Stat Phys 125(2):125\u2013139","journal-title":"Comput Complex Stat Phys"},{"key":"1825_CR14","unstructured":"Moffitt MD (2013) Search strategies for optimal multi-way number partitioning. In: 23rd International Joint Conference on Artificial Intelligence"},{"issue":"2020","key":"1825_CR15","first-page":"10","volume":"27","author":"T Pohlert","year":"2014","unstructured":"Pohlert T (2014) The pairwise multiple comparison of mean ranks package (pmcmr). R package 27(2020):10","journal-title":"R package"},{"key":"1825_CR16","doi-asserted-by":"crossref","unstructured":"Pop PC, Matei O (2013) A genetic algorithm approach for the multidimensional two-way number partitioning problem. In: International conference on learning and intelligent optimization, pp 81\u201386. Springer","DOI":"10.1007\/978-3-642-44973-4_10"},{"issue":"22","key":"1825_CR17","doi-asserted-by":"publisher","first-page":"9191","DOI":"10.1016\/j.apm.2013.03.075","volume":"37","author":"PC Pop","year":"2013","unstructured":"Pop PC, Matei O (2013) A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem. Appl Math Model 37(22):9191\u20139202","journal-title":"Appl Math Model"},{"issue":"5","key":"1825_CR18","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/TIT.1978.1055927","volume":"24","author":"R Merkle","year":"1978","unstructured":"Merkle R, Hellman M (1978) Hiding information and signatures in trapdoor knapsacks. IEEE Trans Inf Theory 24(5):525\u2013530","journal-title":"IEEE Trans Inf Theory"},{"key":"1825_CR19","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/j.cor.2016.09.005","volume":"78","author":"FJ Rodriguez","year":"2017","unstructured":"Rodriguez FJ, Glover F, Garc\u00eda-Mart\u00ednez C, Mart\u00ed R, Lozano M (2017) Grasp with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem. Comput Oper Res 78:243\u2013254","journal-title":"Comput Oper Res"},{"key":"1825_CR20","doi-asserted-by":"crossref","unstructured":"Santucci V, Baioletti M, Di\u00a0Bari G, Milani A (2019) A binary algebraic differential evolution for the multidimensional two-way number partitioning problem. In: European conference on evolutionary computation in combinatorial optimization (Part of EvoStar), pp 17\u201332. Springer","DOI":"10.1007\/978-3-030-16711-0_2"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-01825-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s40314-022-01825-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-022-01825-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T18:14:22Z","timestamp":1650305662000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s40314-022-01825-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,26]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["1825"],"URL":"https:\/\/doi.org\/10.1007\/s40314-022-01825-2","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"type":"print","value":"2238-3603"},{"type":"electronic","value":"1807-0302"}],"subject":[],"published":{"date-parts":[[2022,3,26]]},"assertion":[{"value":"15 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 February 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"119"}}