{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T18:58:20Z","timestamp":1704999500701},"reference-count":37,"publisher":"Vilnius University Press","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.15388\/20-infor391","type":"journal-article","created":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T06:03:02Z","timestamp":1585029782000},"page":"1-20","source":"Crossref","is-referenced-by-count":1,"title":["A Complementary Column Generation Approach for the Graph Equipartition Problem"],"prefix":"10.15388","author":[{"given":"Salem M.","family":"Al-Ykoob","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanif D.","family":"Sherali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"6097","published-online":{"date-parts":[[2020,3,23]]},"reference":[{"issue":"3","key":"20200323164525_j_infor391_ref_001","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","article-title":"Branch-and-price column generation for solving huge integer programs","volume":"46","year":"1998","journal-title":"Operation Research"},{"key":"20200323164525_j_infor391_ref_002","volume-title":"Linear Programming and Network Flows","year":"2010","edition":"4"},{"key":"20200323164525_j_infor391_ref_003","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1287\/opre.14.1.52","article-title":"Scheduling to minimize interaction costs","volume":"14","year":"1966","journal-title":"Operations Research"},{"key":"20200323164525_j_infor391_ref_004","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0020-0190(96)00175-5","article-title":"Approximating the maximally balanced connected partition problem in graphs","volume":"60","year":"1996","journal-title":"Information Processing Letters"},{"key":"20200323164525_j_infor391_ref_005","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01588778","article-title":"The equipartition polytope. I: formulations, dimension and basic facets","volume":"49","year":"1990","journal-title":"Mathematical Programming"},{"key":"20200323164525_j_infor391_ref_006","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF01588779","article-title":"The equipartition polytope. II: valid inequalities and facets","volume":"49","year":"1990","journal-title":"Mathematical Programming"},{"issue":"1","key":"20200323164525_j_infor391_ref_007","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1109\/69.979982","article-title":"Practical data oriented microaggregation for statistical disclosure control","volume":"14","year":"2002","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"5","key":"20200323164525_j_infor391_ref_008","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1147\/rd.175.0420","article-title":"Lower bounds for the partitioning of graphs","volume":"17","year":"1973","journal-title":"IBM Journal of Research and Development"},{"key":"20200323164525_j_infor391_ref_009","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","year":"2010","journal-title":"Journal of Global Optimization"},{"key":"20200323164525_j_infor391_ref_010","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/s10878-010-9351-5","article-title":"Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs","volume":"23","year":"2012","journal-title":"Journal of Combinatorial Optimization"},{"key":"20200323164525_j_infor391_ref_011","volume-title":"BIOMAT 2009 \u2013 International Symposium on Mathematical and Computational Biology","year":"2009"},{"key":"20200323164525_j_infor391_ref_012","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","year":"1976","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"20200323164525_j_infor391_ref_013","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/s11590-008-0097-2","article-title":"Complementary column generation and bounding approaches for set partitioning formulations","volume":"3","year":"2009","journal-title":"Optimization Letters"},{"key":"20200323164525_j_infor391_ref_014","volume-title":"29th Annual IEEE Symposium on Foundations of Computer Science","year":"1988"},{"key":"20200323164525_j_infor391_ref_015","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01589097","article-title":"A cutting plane algorithm for a clustering problem","volume":"45","year":"1989","journal-title":"Mathematical Programming"},{"key":"20200323164525_j_infor391_ref_016","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01580870","article-title":"Facets of the clique partitioning polytope","volume":"47","year":"1990","journal-title":"Mathematical Programming"},{"issue":"4","key":"20200323164525_j_infor391_ref_017","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1137\/S0895480199335829","article-title":"Graph partitioning and continuous quadratic programming","volume":"12","year":"1999","journal-title":"SIAM J. Discret. Math"},{"key":"20200323164525_j_infor391_ref_018","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s001860200173","article-title":"Multiset graph partitioning","volume":"55","year":"2002","journal-title":"Math. Meth. Oper Res"},{"key":"20200323164525_j_infor391_ref_019"},{"key":"20200323164525_j_infor391_ref_020","first-page":"77","volume-title":"Topics in Semidefinite and Interior-Point Methods","year":"1998"},{"issue":"1","key":"20200323164525_j_infor391_ref_021","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/92.748202","article-title":"Multilevel hypergraph partitioning: applications in VLSI domain","volume":"7","year":"1999","journal-title":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems"},{"issue":"11","key":"20200323164525_j_infor391_ref_022","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.40.11.1533","article-title":"Clustering for the design of SONET rings in interoffice telecommunications","volume":"40","year":"1994","journal-title":"Management Science"},{"key":"20200323164525_j_infor391_ref_023","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-002-0342-x","article-title":"Graph partitioning using linear and semidefinite programming","volume":"95","year":"2003","journal-title":"Mathematical Programming Series B"},{"key":"20200323164525_j_infor391_ref_024","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(98)00006-6","article-title":"Cliques and clustering: a combinatorial approach","volume":"22","year":"1998","journal-title":"Operation Research Letters"},{"issue":"8","key":"20200323164525_j_infor391_ref_025","doi-asserted-by":"crossref","first-page":"1100","DOI":"10.1287\/mnsc.44.8.1100","article-title":"An optimization based heuristic for political districting","volume":"44","year":"1998","journal-title":"Management Science"},{"key":"20200323164525_j_infor391_ref_026"},{"issue":"7","key":"20200323164525_j_infor391_ref_027","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","year":"2003","journal-title":"Naval Research Logistics"},{"issue":"3","key":"20200323164525_j_infor391_ref_028","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/mnsc.46.3.363.12066","article-title":"Telecomunication node clustering with node compatibility and network survivability requirements","volume":"46","year":"2000","journal-title":"Management Science"},{"key":"20200323164525_j_infor391_ref_029","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/j.endm.2004.06.033","article-title":"Approximation results on balanced connected partitions of graphs","volume":"18","year":"2004","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"20200323164525_j_infor391_ref_030","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.knosys.2006.11.013","article-title":"Domain-dependent distributed models for railway scheduling","volume":"20","year":"2007","journal-title":"Knowledge Based Systems"},{"key":"20200323164525_j_infor391_ref_031","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","article-title":"Survey: graph clustering","volume":"1","year":"2007","journal-title":"Computer Science Review"},{"key":"20200323164525_j_infor391_ref_032","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/978-1-4613-0303-9_7","volume-title":"Handbook of Combinatorial Optimization","year":"1998"},{"issue":"11","key":"20200323164525_j_infor391_ref_033","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1049\/el:20030536","article-title":"Video scene clustering by graph partitioning","volume":"39","year":"2003","journal-title":"Electronics Letters"},{"key":"20200323164525_j_infor391_ref_034","first-page":"461","article-title":"Semidefinite programming relaxations for the graph partitioning problem","volume":"96\u201397","year":"1996","journal-title":"Discrete Applied Mathematics"},{"key":"20200323164525_j_infor391_ref_035","doi-asserted-by":"crossref","first-page":"1899","DOI":"10.1016\/j.comcom.2007.02.016","article-title":"Analysis and algorithms design for the partition of large-scale adaptive mobile wireless networks","volume":"30","year":"2007","journal-title":"Computer Communications"},{"issue":"1\u20132","key":"20200323164525_j_infor391_ref_036","first-page":"101","article-title":"Finding optimal realighment in sports leagues using a branch-and-cut-and-price approach","volume":"1","year":"2005","journal-title":"International Journal of Operational Research"},{"key":"20200323164525_j_infor391_ref_037","first-page":"25","volume-title":"CIKM\u201901: Proceedings of the Tenth International Conference on Information and Knowledge Management","year":"2001"}],"container-title":["Informatica"],"original-title":[],"language":"en","deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T06:03:18Z","timestamp":1585029798000},"score":1,"resource":{"primary":{"URL":"https:\/\/informatica.vu.lt\/doi\/10.15388\/20-INFOR391"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":37,"alternative-id":["10.15388\/20-INFOR391"],"URL":"https:\/\/doi.org\/10.15388\/20-infor391","relation":{},"ISSN":["0868-4952","1822-8844"],"issn-type":[{"value":"0868-4952","type":"print"},{"value":"1822-8844","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}