{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T15:17:19Z","timestamp":1768403839622,"version":"3.49.0"},"reference-count":43,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T00:00:00Z","timestamp":1601510400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2020,10]]},"DOI":"10.1007\/s13675-020-00126-9","type":"journal-article","created":{"date-parts":[[2020,6,17]],"date-time":"2020-06-17T06:03:59Z","timestamp":1592373839000},"page":"289-308","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"title":["An exact approach for the multi-constraint graph partitioning problem"],"prefix":"10.1016","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6981-2272","authenticated-orcid":false,"given":"Diego","family":"Recalde","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2057-1719","authenticated-orcid":false,"given":"Ramiro","family":"Torres","sequence":"additional","affiliation":[]},{"given":"Polo","family":"Vaca","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1007\/s13675-020-00126-9_CR1","doi-asserted-by":"crossref","unstructured":"Aardal K, Bixby RE, Hurkens CAJ, Lenstra AK, Smeltink JW (1999) Market split and basis reduction: towards a solution of the cornu\u00e9jols-dawande instances. In: Integer programming and combinatorial optimization. Springer, Berlin, pp 1\u201316","DOI":"10.1007\/3-540-48777-8_1"},{"issue":"1","key":"10.1007\/s13675-020-00126-9_CR2","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","article-title":"Interior point methods in semidefinite programming with applications to combinatorial optimization","volume":"5","author":"Alizadeh","year":"1995","journal-title":"SIAM J Optim"},{"issue":"5","key":"10.1007\/s13675-020-00126-9_CR3","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1016\/j.jpdc.2007.09.006","article-title":"Multi-level direct k-way hypergraph partitioning with multiple constraints and fixed vertices","volume":"68","author":"Aykanat","year":"2008","journal-title":"J Parall Distribut Comput"},{"key":"10.1007\/s13675-020-00126-9_CR4","series-title":"Algorithm engineering: selected results and surveys","first-page":"117","article-title":"Recent advances in graph partitioning","author":"Bulu\u00e7","year":"2016"},{"issue":"1","key":"10.1007\/s13675-020-00126-9_CR5","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.14.1.52","article-title":"Scheduling to minimize interaction cost","volume":"14","author":"Carlson","year":"1966","journal-title":"Oper Res"},{"issue":"1-3","key":"10.1007\/s13675-020-00126-9_CR6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01581239","article-title":"The partition problem","volume":"59","author":"Chopra","year":"1993","journal-title":"Math Program"},{"issue":"1","key":"10.1007\/s13675-020-00126-9_CR7","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1137\/0130006","article-title":"The optimal partitioning of graphs","volume":"30","author":"Christofides","year":"1976","journal-title":"SIAM J Appl Math"},{"issue":"2","key":"10.1007\/s13675-020-00126-9_CR8","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10107-014-0811-z","article-title":"An exact combinatorial algorithm for minimum graph bisection","volume":"153","author":"Delling","year":"2014","journal-title":"Math Program"},{"issue":"3","key":"10.1007\/s13675-020-00126-9_CR9","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/s10589-017-9967-9","article-title":"A two-level graph partitioning problem arising in mobile wireless communications","volume":"69","author":"Fairbrother","year":"2017","journal-title":"Comput Optim Appl"},{"issue":"1","key":"10.1007\/s13675-020-00126-9_CR10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10898-009-9520-1","article-title":"Linear and quadratic programming approaches for the general graph partitioning problem","volume":"48","author":"Fan","year":"2010","journal-title":"J Global Optim"},{"key":"10.1007\/s13675-020-00126-9_CR11","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01581107","article-title":"The node capacitated graph partitioning problem: a computational study","volume":"81","author":"Ferreira","year":"1998","journal-title":"Math Program"},{"issue":"4","key":"10.1007\/s13675-020-00126-9_CR12","doi-asserted-by":"crossref","first-page":"619","DOI":"10.21136\/CMJ.1975.101357","article-title":"A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory","volume":"25","author":"Fiedler","year":"1975","journal-title":"Czechoslov Math J"},{"issue":"3","key":"10.1007\/s13675-020-00126-9_CR13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret Comput Sci"},{"key":"10.1007\/s13675-020-00126-9_CR14","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01589097","article-title":"A cutting plane algorithm for a clustering problem","volume":"45","author":"Gr\u00f6tschel","year":"1989","journal-title":"Math Program"},{"key":"10.1007\/s13675-020-00126-9_CR15","unstructured":"Gutierrez S, Miniguano A, Recalde D, Torres LM, Torres R, Zuleta P (2019) Integrated vehicle and pollster routing. Technical report, Escuela Polit\u00e9cnica Nacional, Department of Mathematics, 07"},{"issue":"1-2","key":"10.1007\/s13675-020-00126-9_CR16","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10107-011-0503-x","article-title":"An exact algorithm for graph partitioning","volume":"137","author":"Hager","year":"2011","journal-title":"Math Program"},{"issue":"12","key":"10.1007\/s13675-020-00126-9_CR17","doi-asserted-by":"crossref","first-page":"1519","DOI":"10.1016\/S0167-8191(00)00048-X","article-title":"Graph partitioning models for parallel computing","volume":"26","author":"Hendrickson","year":"2000","journal-title":"Parallel Comput"},{"key":"10.1007\/s13675-020-00126-9_CR18","doi-asserted-by":"crossref","unstructured":"Hendrickson B, Leland R (1995) A multilevel algorithm for partitioning graphs. In: Proceedings of the 1995 ACM\/IEEE conference on Supercomputing (CDROM)\u2013Supercomputing 95. ACM Press","DOI":"10.1145\/224170.224228"},{"key":"10.1007\/s13675-020-00126-9_CR19","unstructured":"Inc. Gurobi\u00a0Optimization (2018) Gurobi optimizer reference manual"},{"key":"10.1007\/s13675-020-00126-9_CR20","series-title":"VLSI physical design: from graph partitioning to timing closure","author":"Kahng","year":"2011"},{"issue":"4","key":"10.1007\/s13675-020-00126-9_CR21","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.disopt.2011.07.001","article-title":"Orbitopal fixing","volume":"8","author":"Kaibel","year":"2011","journal-title":"Discret Optim"},{"issue":"1","key":"10.1007\/s13675-020-00126-9_CR22","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","article-title":"A fast and high quality multilevel scheme for partitioning irregular graphs","volume":"20","author":"Karypis","year":"1998","journal-title":"SIAM J Sci Comput"},{"key":"10.1007\/s13675-020-00126-9_CR23","doi-asserted-by":"crossref","unstructured":"Karypis G, Kumar V (1998) Multilevel algorithms for multi-constraint graph partitioning. In: Proceedings of the IEEE\/ACM SC98 conference. IEEE","DOI":"10.1109\/SC.1998.10018"},{"issue":"2","key":"10.1007\/s13675-020-00126-9_CR24","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kernighan","year":"1970","journal-title":"Bell Syst Tech J"},{"key":"10.1007\/s13675-020-00126-9_CR25","doi-asserted-by":"crossref","first-page":"3473","DOI":"10.1016\/j.disc.2010.08.009","article-title":"Size-constrained graph partitioning polytopes","volume":"310","author":"Labb\u00e9","year":"2010","journal-title":"Discret Math"},{"key":"10.1007\/s13675-020-00126-9_CR26","doi-asserted-by":"crossref","unstructured":"Margot F (2009) Symmetry in integer linear programming. In: 50 years of integer programming 1958\u20132008. Springer, Berlin, pp 647\u2013686","DOI":"10.1007\/978-3-540-68279-0_17"},{"key":"10.1007\/s13675-020-00126-9_CR27","unstructured":"Meila M (2016) Spectral clustering: a tutorial for the 2010\u2019 s. 2016"},{"key":"10.1007\/s13675-020-00126-9_CR28","unstructured":"Mitchell JE (2001) Branch-and-cut for the k-way equipartition problem. Technical report, Department of Mathematical Sciences, Rensselaer Polytechnic Institute"},{"issue":"7","key":"10.1007\/s13675-020-00126-9_CR29","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1002\/nav.10084","article-title":"Realignment in the national football league: Did they do it right?","volume":"50","author":"Mitchell","year":"2003","journal-title":"Naval Res Log"},{"issue":"1","key":"10.1007\/s13675-020-00126-9_CR30","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s10107-009-0273-x","article-title":"Orbital branching","volume":"126","author":"Ostrowski","year":"2009","journal-title":"Math Program"},{"issue":"3","key":"10.1007\/s13675-020-00126-9_CR31","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1007\/s10878-018-0254-1","article-title":"An exact approach for the balanced k-way partitioning problem with weight constraints and its application to sports team realignment","volume":"36","author":"Recalde","year":"2018","journal-title":"J Combin Optim"},{"issue":"4","key":"10.1007\/s13675-020-00126-9_CR32","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10288-012-0210-3","article-title":"Semidefinite relaxations for partitioning, assignment and ordering problems","volume":"10","author":"Rendl","year":"2012","journal-title":"4OR"},{"issue":"1","key":"10.1007\/s13675-020-00126-9_CR33","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10479-017-2448-9","article-title":"Computational study of valid inequalities for the maximum k-cut problem","volume":"265","author":"Rodrigues de Sousa","year":"2017","journal-title":"Ann Oper Res"},{"key":"10.1007\/s13675-020-00126-9_CR34","doi-asserted-by":"crossref","unstructured":"Sanders P, Schulz C (2012) Distributed evolutionary graph partitioning. In: 2012 Proceedings of the fourteenth workshop on algorithm engineering and experiments (ALENEX), Society for Industrial and Applied Mathematics, pp 16\u201329","DOI":"10.1137\/1.9781611972924.2"},{"issue":"3","key":"10.1007\/s13675-020-00126-9_CR35","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1002\/cpe.605","article-title":"Parallel static and dynamic multi-constraint graph partitioning","volume":"14","author":"Schloegel","year":"2002","journal-title":"Concurr Comput Pract Exp"},{"issue":"8","key":"10.1007\/s13675-020-00126-9_CR36","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1109\/34.868688","article-title":"Normalized cuts and image segmentation","volume":"22","author":"Shi","year":"2000","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"10.1007\/s13675-020-00126-9_CR37","doi-asserted-by":"crossref","unstructured":"Slota GM, Madduri K, Rajamanickam S (2014) Pulp: Scalable multi-objective multi-constraint partitioning for small-world networks. 2014 IEEE International Conference on Big Data (Big Data), pp 481\u2013490","DOI":"10.1109\/BigData.2014.7004265"},{"issue":"1","key":"10.1007\/s13675-020-00126-9_CR38","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1287\/ijoc.1120.0542","article-title":"An efficient semidefinite programming relaxation for the graph partition problem","volume":"26","author":"Sotirov","year":"2014","journal-title":"INFORMS J Comput"},{"issue":"2-3","key":"10.1007\/s13675-020-00126-9_CR39","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.laa.2006.07.020","article-title":"Spectral partitioning works: Planar graphs and finite element meshes","volume":"421","author":"Spielman","year":"2007","journal-title":"Linear Algebra Appl"},{"key":"10.1007\/s13675-020-00126-9_CR40","doi-asserted-by":"crossref","unstructured":"Tanaka M, Tatebe O (2012) Workflow scheduling to minimize data movement using multi-constraint graph partitioning. In: 2012 12th IEEE\/ACM international symposium on cluster, cloud and grid computing (ccgrid 2012), pp 65\u201372","DOI":"10.1109\/CCGrid.2012.134"},{"issue":"4","key":"10.1007\/s13675-020-00126-9_CR41","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.1137\/040617431","article-title":"Partitioning sparse matrices for parallel preconditioned iterative methods","volume":"29","author":"U\u00e7ar","year":"2007","journal-title":"SIAM J Sci Comput"},{"key":"10.1007\/s13675-020-00126-9_CR42","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/S0166-218X(99)00102-X","article-title":"Semidefinite programming relaxations for the graph partitioning problem","volume":"96-97","author":"Wolkowicz","year":"1999","journal-title":"Discret. Appl. Math."},{"key":"10.1007\/s13675-020-00126-9_CR43","doi-asserted-by":"crossref","unstructured":"Zhan Q, Zhu W, He X (2010) A grasp based algorithm for multi-constraint circuit partitioning. In: 2010 sixth international conference on natural computation, vol 6, pp 3110\u20133114","DOI":"10.1109\/ICNC.2010.5584618"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-020-00126-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13675-020-00126-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001313?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621001313?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-020-00126-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:48:08Z","timestamp":1761882488000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621001313"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10]]},"references-count":43,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2020,10]]}},"alternative-id":["S2192440621001313"],"URL":"https:\/\/doi.org\/10.1007\/s13675-020-00126-9","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2020,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An exact approach for the multi-constraint graph partitioning problem","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-020-00126-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2020 The Author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}