{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T15:24:30Z","timestamp":1774279470210,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,6,15]],"date-time":"2023-06-15T00:00:00Z","timestamp":1686787200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,15]],"date-time":"2023-06-15T00:00:00Z","timestamp":1686787200000},"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":[[2023,7]]},"DOI":"10.1007\/s10878-023-01051-4","type":"journal-article","created":{"date-parts":[[2023,6,15]],"date-time":"2023-06-15T03:28:01Z","timestamp":1686799681000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Balanced graph partitioning based on mixed 0-1 linear programming and iteration vertex relocation algorithm"],"prefix":"10.1007","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3173-4843","authenticated-orcid":false,"given":"Zhengxi","family":"Yang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3953-1231","authenticated-orcid":false,"given":"Zhipeng","family":"Jiang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8441-7334","authenticated-orcid":false,"given":"Wenguo","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Suixiang","family":"Gao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,15]]},"reference":[{"issue":"11","key":"1051_CR1","doi-asserted-by":"publisher","first-page":"1590","DOI":"10.14778\/3236187.3236208","volume":"11","author":"Z Abbas","year":"2018","unstructured":"Abbas Z, Kalavri V, Carbone P, Vlassov V (2018) Streaming graph partitioning: an experimental study. Proceed VLDB Endow 11(11):1590\u20131603","journal-title":"Proceed VLDB Endow"},{"issue":"1","key":"1051_CR2","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1111\/j.1083-6101.2007.00393.x","volume":"13","author":"DM Boyd","year":"2007","unstructured":"Boyd DM, Ellison NB (2007) Social network sites: definition, history, and scholarship. J Comput Med Commun 13(1):210\u2013230","journal-title":"J Comput Med Commun"},{"key":"1051_CR3","doi-asserted-by":"publisher","first-page":"105301","DOI":"10.1016\/j.cor.2021.105301","volume":"132","author":"M Bruglieri","year":"2021","unstructured":"Bruglieri M, Cordone R (2021) Metaheuristics for the minimum gap graph partitioning problem. Comput Oper Res 132:105301","journal-title":"Comput Oper Res"},{"issue":"3","key":"1051_CR4","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(92)90140-Q","volume":"42","author":"TN Bui","year":"1992","unstructured":"Bui TN, Jones C (1992) Finding good approximate vertex and edge partitions is np-hard. Inf Process Lett 42(3):153\u2013159","journal-title":"Inf Process Lett"},{"key":"1051_CR5","doi-asserted-by":"crossref","unstructured":"Bulu\u00e7 A, Meyerhenke H, Safro I, Sanders P, Schulz C (2016) Recent advances in graph partitioning. Algorithm Eng, pp 117\u2013158","DOI":"10.1007\/978-3-319-49487-6_4"},{"key":"1051_CR6","doi-asserted-by":"crossref","unstructured":"Chiang WL, Liu X, Si S, Li Y, Bengio S, Hsieh CJ (2019) Cluster-gcn: An efficient algorithm for training deep and large graph convolutional networks. In: Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp 257\u2013266","DOI":"10.1145\/3292500.3330925"},{"key":"1051_CR7","doi-asserted-by":"crossref","unstructured":"Deng Z, Suel T (2021) Optimizing iterative algorithms for social network sharding. In: 2021 IEEE international conference on big data (big data), IEEE, pp 400\u2013408","DOI":"10.1109\/BigData52589.2021.9671621"},{"key":"1051_CR8","volume-title":"Column generation","author":"G Desaulniers","year":"2006","unstructured":"Desaulniers G, Desrosiers J, Solomon MM (2006) Column generation, vol 5. Springer Science & Business Media, London"},{"issue":"1","key":"1051_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10898-009-9520-1","volume":"48","author":"N Fan","year":"2010","unstructured":"Fan N, Pardalos PM (2010) Linear and quadratic programming approaches for the general graph partitioning problem. J Glob Optim 48(1):57\u201371","journal-title":"J Glob Optim"},{"key":"1051_CR10","doi-asserted-by":"crossref","unstructured":"Fan N, Zheng QP, Pardalos PM (2011) On the two-stage stochastic graph partitioning problem. In: COCOA","DOI":"10.1007\/978-3-642-22616-8_39"},{"key":"1051_CR11","doi-asserted-by":"crossref","unstructured":"Fiduccia CM, Mattheyses RM (1982) A linear-time heuristic for improving network partitions. In: 19th design automation conference, IEEE, pp 175\u2013181","DOI":"10.1109\/DAC.1982.1585498"},{"key":"1051_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3398634","volume":"25","author":"A Henzinger","year":"2020","unstructured":"Henzinger A, Noe A, Schulz C (2020) ILP-based local search for graph partitioning. J Exp Algorithm (JEA) 25:1\u201326","journal-title":"J Exp Algorithm (JEA)"},{"key":"1051_CR13","doi-asserted-by":"crossref","unstructured":"Hungersh\u00f6fer J, Wierum JM (2002) On the quality of partitions based on space-filling curves. In: International conference on computational science, Springer, pp 36\u201345","DOI":"10.1007\/3-540-47789-6_4"},{"key":"1051_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-9591-6","volume-title":"VLSI physical design: from graph partitioning to timing closure","author":"AB Kahng","year":"2011","unstructured":"Kahng AB, Lienig J, Markov IL, Hu J (2011) VLSI physical design: from graph partitioning to timing closure. Springer Science & Business Media, London"},{"key":"1051_CR15","doi-asserted-by":"crossref","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: 50 years of integer programming","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"2","key":"1051_CR16","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Techn J 49(2):291\u2013307","journal-title":"Bell Syst Techn J"},{"key":"1051_CR17","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"EL Lawler","year":"1966","unstructured":"Lawler EL, Wood DE (1966) Branch-and-bound methods: a survey. Oper Res 14:699\u2013719","journal-title":"Oper Res"},{"key":"1051_CR18","unstructured":"Leskovec J, Krevl A (2014) SNAP Datasets: Stanford large network dataset collection. http:\/\/snap.stanford.edu\/data"},{"issue":"1","key":"1051_CR19","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-002-0342-x","volume":"95","author":"A Lisser","year":"2003","unstructured":"Lisser A, Rendl F (2003) Graph partitioning using linear and semidefinite programming. Math Program 95(1):91\u2013101","journal-title":"Math Program"},{"key":"1051_CR20","unstructured":"Mitchell JE (1988) Branch-and-cut algorithms for combinatorial optimization problems"},{"key":"1051_CR21","unstructured":"Miyazawa FK, Moura PFS, Ota MJ, Wakabayashi Y (2019) Integer programming approaches to balanced connected k-partition. arXiv:1911.05723"},{"key":"1051_CR22","doi-asserted-by":"crossref","unstructured":"Moussawi AE, Seghouani NB, Bugiotti F (2021) Bgrap: Balanced graph partitioning algorithm for large graphs","DOI":"10.26421\/JDI2.2-2"},{"key":"1051_CR23","doi-asserted-by":"crossref","unstructured":"Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. In: Wiley interscience series in discrete mathematics and optimization","DOI":"10.1002\/9781118627372"},{"issue":"1","key":"1051_CR24","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/s10878-021-00754-w","volume":"43","author":"K Nip","year":"2022","unstructured":"Nip K, Shi T, Wang Z (2022) Some graph optimization problems with weights satisfying linear constraints. J Comb Optimiz 43(1):200\u2013225","journal-title":"J Comb Optimiz"},{"issue":"3","key":"1051_CR25","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A Pothen","year":"1990","unstructured":"Pothen A, Simon HD, Liou KP (1990) Partitioning sparse matrices with eigenvectors of graphs. SIAM J Matrix Anal Appl 11(3):430\u2013452","journal-title":"SIAM J Matrix Anal Appl"},{"key":"1051_CR26","doi-asserted-by":"crossref","unstructured":"Ugander J, Backstrom L (2013) Balanced label propagation for partitioning massive graphs. In: Proceedings of the sixth ACM international conference on Web search and data mining, pp 507\u2013516","DOI":"10.1145\/2433396.2433461"},{"key":"1051_CR27","doi-asserted-by":"crossref","unstructured":"Zha H, He X, Ding C, Simon H, Gu M (2001) Bipartite graph partitioning and data clustering. In: Proceedings of the tenth international conference on information and knowledge management, Association for Computing Machinery, New York, NY, USA, CIKM \u201901, p 25-32, 10.1145\/502585.502591","DOI":"10.1145\/502585.502591"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01051-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-023-01051-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-023-01051-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T04:08:17Z","timestamp":1689998897000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-023-01051-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,15]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1051"],"URL":"https:\/\/doi.org\/10.1007\/s10878-023-01051-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,15]]},"assertion":[{"value":"26 May 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 June 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors have not disclosed any competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"121"}}