{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T11:18:48Z","timestamp":1767611928977,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T00:00:00Z","timestamp":1729555200000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s10878-024-01220-z","type":"journal-article","created":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:02:06Z","timestamp":1729634526000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A MILP model for the connected multidimensional maximum bisection problem"],"prefix":"10.1007","volume":"48","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9827-2490","authenticated-orcid":false,"given":"Zoran Lj.","family":"Maksimovi\u0107","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,10,22]]},"reference":[{"key":"1220_CR1","doi-asserted-by":"crossref","unstructured":"Armbruster M, F\u00fcgenschuh M, Helmberg C, Martin A (2008) A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem. In: Integer programming and combinatorial optimization: 13th international conference, IPCO 2008 Bertinoro, Italy, May 26\u201328, 2008 Proceedings 13, 112\u2013124","DOI":"10.1007\/978-3-540-68891-4_8"},{"issue":"5","key":"1220_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0020-0190(96)00175-5","volume":"60","author":"J Chleb\u00edkov\u00e1","year":"1996","unstructured":"Chleb\u00edkov\u00e1 J (1996) Approximating the maximally balanced connected partition problem in graphs. Inf Process Lett 60(5):225\u2013230","journal-title":"Inf Process Lett"},{"issue":"3","key":"1220_CR3","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/S0893-6080(02)00027-8","volume":"15","author":"C Dang","year":"2002","unstructured":"Dang C, He L, Hui IPK (2002) A deterministic annealing algorithm for approximating a solution of the max-bisection problem. Neural Netw 15(3):441\u2013458","journal-title":"Neural Netw"},{"issue":"1","key":"1220_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF02523688","volume":"18","author":"A Frieze","year":"1997","unstructured":"Frieze A, Jerrum M (1997) Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18(1):67\u201381","journal-title":"Algorithmica"},{"issue":"3","key":"1220_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M Gary","year":"1976","unstructured":"Gary M, Johnson D, Stockmeyer L (1976) Some simplified NP-complete graph problems. Theor Comput Sci 1(3):237\u2013267","journal-title":"Theor Comput Sci"},{"issue":"6","key":"1220_CR6","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"Michel X Goemans","year":"1995","unstructured":"Goemans Michel X, Williamson David P (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42(6):1115\u20131145","journal-title":"J ACM"},{"issue":"3","key":"1220_CR7","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1002\/rsa.10035","volume":"20","author":"E Halperin","year":"2002","unstructured":"Halperin E, Zwick U (2002) A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems. Random Struct Algorithms 20(3):382\u2013402","journal-title":"Random Struct Algorithms"},{"issue":"4","key":"1220_CR8","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J Hastad","year":"2001","unstructured":"Hastad J (2001) Some optimal inapproximability results. J ACM 48(4):798\u2013859","journal-title":"J ACM"},{"issue":"2","key":"1220_CR9","doi-asserted-by":"publisher","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":"3","key":"1220_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1287\/ijoc.12.3.177.12637","volume":"12","author":"SE Karisch","year":"2000","unstructured":"Karisch SE, Rendl F, Clausen J (2000) Solving graph bisection problems with semidefinite programming. INFORMS J Comput 12(3):177\u2013191","journal-title":"INFORMS J Comput"},{"issue":"2","key":"1220_CR11","doi-asserted-by":"publisher","first-page":"27","DOI":"10.2298\/YJOR140417027L","volume":"26","author":"J Lazi\u0107","year":"2016","unstructured":"Lazi\u0107 J (2016) Variable and single neighbourhood diving for MIP feasibility. Yugoslav J Oper Res 26(2):27","journal-title":"Yugoslav J Oper Res"},{"issue":"1\u20132","key":"1220_CR12","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1016\/j.cam.2007.08.018","volume":"220","author":"AF Ling","year":"2008","unstructured":"Ling AF, Xu CX, Tang L (2008) A modified VNS metaheuristic for max-bisection problems. J Comput Appl Math 220(1\u20132):413\u2013421","journal-title":"J Comput Appl Math"},{"key":"1220_CR13","unstructured":"Maksimovic Z (2015) A multidimensional maximum bisection problem, arXiv preprint arXiv:1506.07731"},{"key":"1220_CR14","doi-asserted-by":"publisher","first-page":"6453","DOI":"10.1007\/s00500-016-2203-1","volume":"21","author":"Z Maksimovi\u0107","year":"2017","unstructured":"Maksimovi\u0107 Z, Kratica J, Savi\u0107 A (2017) Two metaheuristics for solving the connected multidimensional maximum bisection problem. Soft Comput 21:6453\u20136469","journal-title":"Soft Comput"},{"key":"1220_CR15","first-page":"85","volume":"237","author":"D Mati\u0107","year":"2014","unstructured":"Mati\u0107 D (2014) A mixed integer linear programming model and variable neighborhood search for maximally balanced connected partition problem. Appl Math Comput 237:85\u201397","journal-title":"Appl Math Comput"},{"issue":"1","key":"1220_CR16","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.ejor.2014.12.005","volume":"244","author":"GR Raidl","year":"2015","unstructured":"Raidl GR (2015) Decomposition based hybrid metaheuristics. Eur J Oper Res 244(1):66\u201376","journal-title":"Eur J Oper Res"},{"key":"1220_CR17","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","volume":"111","author":"F Rendl","year":"2010","unstructured":"Rendl F, Rinaldi G, Wiegele A (2010) Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Math Program 111:307\u2013335","journal-title":"Math Program"},{"issue":"08","key":"1220_CR18","doi-asserted-by":"publisher","first-page":"584","DOI":"10.4236\/wsn.2010.28070","volume":"2","author":"I Slama","year":"2010","unstructured":"Slama I, Jouaber B, Zeghlache D (2010) Topology control and routing in large scale wireless sensor networks. Wirel Sens Netw 2(08):584","journal-title":"Wirel Sens Netw"},{"key":"1220_CR19","doi-asserted-by":"crossref","unstructured":"S\u0142owik A, Bia\u0142ko Micha\u0142 (2006) Partitioning of VLSI circuits on subcircuits with minimal number of connections using evolutionary algorithm. In: International conference on artificial intelligence and soft computing, pp 470\u2013478","DOI":"10.1007\/11785231_50"},{"key":"1220_CR20","doi-asserted-by":"crossref","unstructured":"Shi J., Malik J (2000) Normalized cuts and image segmentation. IEEE Transactions on pattern analysis and machine intelligence 22 (8):888\u2013905","DOI":"10.1109\/34.868688"},{"issue":"1","key":"1220_CR21","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/j.cor.2012.06.001","volume":"40","author":"Q Wu","year":"2013","unstructured":"Wu Q, Hao JK (2013) Memetic search for the max-bisection problem. Comput Oper Res 40(1):166\u2013179","journal-title":"Comput Oper Res"},{"issue":"13","key":"1220_CR22","doi-asserted-by":"publisher","first-page":"3718","DOI":"10.1016\/j.cam.2011.01.015","volume":"235","author":"F Xu","year":"2011","unstructured":"Xu F, Ma X, Chen B (2011) A new Lagrangian net algorithm for solving max-bisection problems. J Comput Appl Math 235(13):3718\u20133723","journal-title":"J Comput Appl Math"},{"key":"1220_CR23","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/PL00011415","volume":"90","author":"Y Ye","year":"2001","unstructured":"Ye Y (2001) A 699-approximation algorithm for Max-Bisection. Math Program 90:101\u2013111","journal-title":"Math Program"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01220-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-024-01220-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-024-01220-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T11:05:28Z","timestamp":1730977528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-024-01220-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,22]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["1220"],"URL":"https:\/\/doi.org\/10.1007\/s10878-024-01220-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2024,10,22]]},"assertion":[{"value":"26 September 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"33"}}