{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:17:36Z","timestamp":1740107856695,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"21","license":[{"start":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T00:00:00Z","timestamp":1464652800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004564","name":"Ministarstvo Prosvete, Nauke i Tehnolo\u0161kog Razvoja","doi-asserted-by":"publisher","award":["174010","174033"],"award-info":[{"award-number":["174010","174033"]}],"id":[{"id":"10.13039\/501100004564","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s00500-016-2203-1","type":"journal-article","created":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T07:34:58Z","timestamp":1464680098000},"page":"6453-6469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Two metaheuristics for solving the connected multidimensional maximum bisection problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Zoran","family":"Maksimovi\u0107","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jozef","family":"Kratica","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksandar","family":"Savi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,31]]},"reference":[{"issue":"3","key":"2203_CR1","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1022452626305","volume":"25","author":"\u015eI Birbil","year":"2003","unstructured":"Birbil \u015eI, Fang SC (2003) An electromagnetism-like mechanism for global optimization. J Gobal Optim 25(3):263\u2013282","journal-title":"J Gobal Optim"},{"issue":"2","key":"2203_CR2","first-page":"143","volume":"22","author":"V Filipovi\u0107","year":"2003","unstructured":"Filipovi\u0107 V (2003) Fine-grained tournament selection operator in genetic algorithms. Comput Inform 22(2):143\u2013161","journal-title":"Comput Inform"},{"issue":"3","key":"2203_CR3","doi-asserted-by":"crossref","first-page":"261","DOI":"10.55630\/sjc.2011.5.261-272","volume":"5","author":"V Filipovi\u0107","year":"2011","unstructured":"Filipovi\u0107 V (2011) An electromagnetism metaheuristic for the uncapacitated multiple allocation hub location problem. Serd J Comput 5(3):261\u2013272","journal-title":"Serd J Comput"},{"issue":"1\u20133","key":"2203_CR4","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti M, Lodi A (2003) Local branching. Math Program 98(1\u20133):23\u201347","journal-title":"Math Program"},{"issue":"3","key":"2203_CR5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Stockmeyer L (1976) Some simplified NP-complete graph problems. Theor Comput Sci 1(3):237\u2013267","journal-title":"Theor Comput Sci"},{"key":"2203_CR6","volume-title":"Advances in evolutionary computing: theory and applications","author":"A Ghosh","year":"2012","unstructured":"Ghosh A, Tsutsui S (2012) Advances in evolutionary computing: theory and applications. Springer Science & Business Media, Berlin, Heidelberg"},{"issue":"10","key":"2203_CR7","doi-asserted-by":"crossref","first-page":"3034","DOI":"10.1016\/j.cor.2005.02.033","volume":"33","author":"P Hansen","year":"2006","unstructured":"Hansen P, Mladenovi\u0107 N, Uro\u0161evi\u0107 D (2006) Variable neighborhood search and local branching. Comput Oper Res 33(10):3034\u20133045","journal-title":"Comput Oper Res"},{"issue":"2","key":"2203_CR8","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0916028","volume":"16","author":"B Hendrickson","year":"1995","unstructured":"Hendrickson B, Leland R (1995) An improved spectral graph partitioning algorithm for mapping parallel computations. SIAM J Sci Comput 16(2):452\u2013469","journal-title":"SIAM J Sci Comput"},{"issue":"1","key":"2203_CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.2298\/YJOR110608018K","volume":"23","author":"A Kartelj","year":"2013","unstructured":"Kartelj A (2013) Electromagnetism metaheuristic algorithm for solving the strong minimum energy topology problem. Yu J Oper Res 23(1):43\u201357","journal-title":"Yu J Oper Res"},{"issue":"3","key":"2203_CR10","first-page":"271","volume":"18","author":"J Kratica","year":"1999","unstructured":"Kratica J (1999) Improving performances of the genetic algorithm by caching. Comput Artif intell 18(3):271\u2013283","journal-title":"Comput Artif intell"},{"issue":"4","key":"2203_CR11","doi-asserted-by":"crossref","first-page":"688","DOI":"10.15837\/ijccc.2012.4.1367","volume":"7","author":"J Kratica","year":"2012","unstructured":"Kratica J (2012) An electromagnetism-like approach for solving the low autocorrelation binary sequence problem. Int J Comput Commun Control 7(4):688\u2013695","journal-title":"Int J Comput Commun Control"},{"issue":"3","key":"2203_CR12","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s10462-012-9314-6","volume":"41","author":"TY Lim","year":"2014","unstructured":"Lim TY (2014) Structured population genetic algorithms: a literature survey. Artif Intell Rev 41(3):385\u2013399","journal-title":"Artif Intell Rev"},{"key":"2203_CR13","unstructured":"Maksimovi\u0107 Z (2015a) A connected multidimensional maximum bisection problem. Preprint. arXiv:1512.00614"},{"key":"2203_CR14","unstructured":"Maksimovi\u0107 Z (2015b) A multidimensional maximum bisection problem. Preprint. arXiv:1506.07731"},{"key":"2203_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.swevo.2011.11.003","volume":"2","author":"F Neri","year":"2012","unstructured":"Neri F, Cotta C (2012) Memetic algorithms and memetic computing optimization: a literature review. Swarm Evol Comput 2:1\u201314","journal-title":"Swarm Evol Comput"},{"issue":"8","key":"2203_CR16","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Patt Anal Mach Intell 22(8):888\u2013905","journal-title":"IEEE Trans Patt Anal Mach Intell"},{"key":"2203_CR17","doi-asserted-by":"crossref","unstructured":"S\u0142owik A, Bia\u0142ko M (2006) Partitioning of vlsi circuits on subcircuits with minimal number of connections using evolutionary algorithm. In: Rutkowski L, Tadeusiewicz R, Zadeh LA, Zurada J (eds) Artificial intelligence and soft computing\u2014ICAISC 2006, Springer, Berlin, Heidelberg pp 470\u2013478","DOI":"10.1007\/11785231_50"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-016-2203-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2203-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2203-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-016-2203-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,18]],"date-time":"2023-08-18T17:46:58Z","timestamp":1692380818000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-016-2203-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,31]]},"references-count":17,"journal-issue":{"issue":"21","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["2203"],"URL":"https:\/\/doi.org\/10.1007\/s00500-016-2203-1","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2016,5,31]]}}}