{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T14:20:39Z","timestamp":1768400439074,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,1,5]],"date-time":"2010-01-05T00:00:00Z","timestamp":1262649600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10898-009-9520-1","type":"journal-article","created":{"date-parts":[[2010,1,4]],"date-time":"2010-01-04T05:03:22Z","timestamp":1262581402000},"page":"57-71","source":"Crossref","is-referenced-by-count":47,"title":["Linear and quadratic programming approaches for the general graph partitioning problem"],"prefix":"10.1007","volume":"48","author":[{"given":"Neng","family":"Fan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,1,5]]},"reference":[{"issue":"1\u20132","key":"9520_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"C.J. Alpert","year":"1995","unstructured":"Alpert C.J., Kahng A.B.: Recent directions in netlist partitioning: a survey. Integr. VLSI J. 19(1\u20132), 1\u201381 (1995)","journal-title":"Integr. VLSI J."},{"key":"9520_CR2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1023\/B:OPTE.0000038889.84284.c7","volume":"5","author":"M. Boulle","year":"2004","unstructured":"Boulle M.: Compact mathematical formulation for graph partitioning. Optim. Eng. 5, 315\u2013333 (2004)","journal-title":"Optim. Eng."},{"key":"9520_CR3","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/S1052623400382467","volume":"12","author":"S. Burer","year":"2001","unstructured":"Burer S., Monteiro R.D.C., Zhang Y.: Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs. SIAM J. Optim. 12, 503\u2013521 (2001)","journal-title":"SIAM J. Optim."},{"key":"9520_CR4","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1016\/j.orl.2004.03.005","volume":"32","author":"W. Chaovalitwongse","year":"2004","unstructured":"Chaovalitwongse W., Pardalos P.M., Prokopyev O.A.: A new linearization technique for multi-quadratic 0\u20131 programming problems. Oper. Res. Lett. 32, 517\u2013522 (2004)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"9520_CR5","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/mnsc.41.4.704","volume":"41","author":"P. Chardaire","year":"1995","unstructured":"Chardaire P., Sutter A.: A decomposition method for quadratic zero-one programming. Manag. Sci. 41(4), 704\u2013712 (1995)","journal-title":"Manag. Sci."},{"key":"9520_CR6","unstructured":"ILOG CPLEX 11.0 Users Manual, (2007)"},{"key":"9520_CR7","unstructured":"Elsner, U.: Graph partitioning\u2014A survey. Technische Universitat Chemnitz, SFB393-Preprint 97\u201327 (1997)"},{"key":"9520_CR8","volume-title":"Optimization and Optimal Control: Theory and Applications","author":"N. Fan","year":"2009","unstructured":"Fan N., Chinchuluun A., Pardalos P.M.: Integer programming of biclustering based on graph models. In: Chinchuluun, A., Pardalos, P.M., Enkhbat, R., Tseveendorj, I. (eds) Optimization and Optimal Control: Theory and Applications, Springer, Berlin (2009)"},{"key":"9520_CR9","doi-asserted-by":"crossref","unstructured":"Fan, N., Pardalos, P.M., Chinchuluun, A., Pistikopoulos, E.N.: Graph partitioning approaches for analyzing biological networks. In: BIOMAT 2009\u2014International Symposium on Mathematical and Computational Biology, submitted (2009)","DOI":"10.1142\/9789814304900_0017"},{"key":"9520_CR10","unstructured":"Fan, N., Pardalos, P.M.: Robust optimization of graph partitioning involving uncertainty, In preparation (2009)"},{"key":"9520_CR11","first-page":"10","volume":"3","author":"P.-O. Fjallstrom","year":"1998","unstructured":"Fjallstrom P.-O.: Algorithms for graph partitioning: a survey. Linkop. Elec. Articles Comput. Inf. Sci. 3, 10 (1998)","journal-title":"Linkop. Elec. Articles Comput. Inf. Sci."},{"key":"9520_CR12","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M.R. Garey","year":"1976","unstructured":"Garey M.R., Johnson D.S., Stockmeyer L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1, 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"9520_CR13","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1137\/S0895480199335829","volume":"12","author":"W. Hager","year":"1999","unstructured":"Hager W., Krylyuk Y.: Graph partitioning and continuous quadratic programming. SIAM J. Discret. Math. 12(4), 500\u2013523 (1999)","journal-title":"SIAM J. Discret. Math."},{"key":"9520_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s001860200173","volume":"55","author":"W. Hager","year":"2002","unstructured":"Hager W., Krylyuk Y.: Multiset graph partitioning. Math. Meth. Oper. Res. 55, 1\u201310 (2002)","journal-title":"Math. Meth. Oper. Res."},{"key":"9520_CR15","doi-asserted-by":"crossref","unstructured":"Karypis, G., Kumar, V.: Parallel multilevel graph partitioning. In: 10th International Parallel Processing Symposium (IPPS \u201996), 314 (1996)","DOI":"10.1109\/IPPS.1996.508075"},{"issue":"1","key":"9520_CR16","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1109\/92.748202","volume":"7","author":"G. Karypis","year":"1999","unstructured":"Karypis G., Aggarwal R., Kumar V., Shekhar S.: Multilevel hypergraph partitioning: applications in VLSI domain. IEEE Trans. Very Larg. Scale Integr. (VLSI) Syst. 7(1), 69\u201379 (1999)","journal-title":"IEEE Trans. Very Larg. Scale Integr. (VLSI) Syst."},{"key":"9520_CR17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1090\/fic\/018\/06","volume-title":"Topics in Semidefinite and Interior-Point Methods","author":"S.E. Karisch","year":"1998","unstructured":"Karisch S.E., Rendl F.: Semidefinite programming and graph equipartition. In: Pardalos, P.M., Wolkowicz, H. (eds) Topics in Semidefinite and Interior-Point Methods, pp. 77\u201395. American Mathmatical Society, USA (1998)"},{"issue":"1","key":"9520_CR18","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan B.W., Lin S.: An Efficient Heuristic Procedure for Partitioning Graphs. Bell Syst. Tech. J. 49(1), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"issue":"1","key":"9520_CR19","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10479-005-3449-7","volume":"139","author":"G.A. Kochenberger","year":"2005","unstructured":"Kochenberger G.A., Glover F., Alidaee B., Rego C.: An unconstrained quadratic binary programming approach to the vertex coloring problem. Ann. Oper. Res. 139(1), 229\u2013241 (2005)","journal-title":"Ann. Oper. Res."},{"key":"9520_CR20","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-002-0342-x","volume":"95","author":"A. Lisser","year":"2003","unstructured":"Lisser A., Rendl F.: Graph partitioning using linear and semidefinite programming. Math. Program. Ser. B 95, 91\u2013101 (2003)","journal-title":"Math. Program. Ser. B"},{"issue":"3","key":"9520_CR21","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/S0377-2217(98)00359-2","volume":"119","author":"A. Lodi","year":"1999","unstructured":"Lodi A., Allemand K., Liebling T.M.: An evolutionary heuristic for quadratic 0\u20131 programming. Eur. J. Oper. Res. 119(3), 662\u2013670 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9520_CR22","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"E.M. Loiola","year":"2007","unstructured":"Loiola E.M., de Abreu N.M.M., Boaventura-Netto P.O., Hahn P., Querido T.: A survey for the quadratic assignment problem. Eur. J. Oper. Res. 176(2), 657\u2013690 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"9520_CR23","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"P.M. Pardalos","year":"1990","unstructured":"Pardalos P.M., Rodgers G.P.: Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45, 131\u2013144 (1990)","journal-title":"Computing"},{"key":"9520_CR24","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"S.E. Schaeffer","year":"2007","unstructured":"Schaeffer S.E.: Survey: graph clustering. Comput. Sci. Rev. 1, 27\u201364 (2007)","journal-title":"Comput. Sci. Rev."},{"key":"9520_CR25","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11590-006-0019-0","volume":"1","author":"H.D. Sherali","year":"2007","unstructured":"Sherali H.D., Smith J.C.: An improved linearization strategy for zero-one quadratic programming problems. Optim. Lett. 1, 33\u201347 (2007)","journal-title":"Optim. Lett."},{"key":"9520_CR26","doi-asserted-by":"crossref","first-page":"1259","DOI":"10.1016\/0167-8191(92)90069-J","volume":"18","author":"R.G. Strongin","year":"1992","unstructured":"Strongin R.G., Sergeyev Ya, D.: Global multidimensional optimization on parallel computer. Parallel Comput. 18, 1259\u20131273 (1992)","journal-title":"Parallel Comput."},{"issue":"1","key":"9520_CR27","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1023\/A:1024652720089","volume":"27","author":"R.G. Strongin","year":"2003","unstructured":"Strongin R.G., Sergeyev Ya, D.: Global optimization: fractal approach and non-redundant parallelism. J. Glob. Optim. 27(1), 25\u201350 (2003)","journal-title":"J. Glob. Optim."},{"key":"9520_CR28","first-page":"461","volume":"96\u201397","author":"H. Wolkowicz","year":"1996","unstructured":"Wolkowicz H., Zhao Q.: Semidefinite programming relaxations for the graph partitioning problem. Discret. Appl. Math. 96\u201397, 461\u2013479 (1996)","journal-title":"Discret. Appl. Math."},{"key":"9520_CR29","doi-asserted-by":"crossref","unstructured":"Zha, H., He, X., Ding, C., Simon, H., Gu, M.: Bipartite graph partitioning and data clustering. In: CIKM \u201901: Proceedings of the Tenth International Conference on Information and Knowledge Management, pp. 25\u201332. ACM Press, New York, NY (2001)","DOI":"10.1145\/502585.502591"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-009-9520-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-009-9520-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-009-9520-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:58:55Z","timestamp":1559264335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-009-9520-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,5]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["9520"],"URL":"https:\/\/doi.org\/10.1007\/s10898-009-9520-1","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,5]]}}}