{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T17:50:58Z","timestamp":1648749058048},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,10,5]],"date-time":"2015-10-05T00:00:00Z","timestamp":1444003200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s11590-015-0953-9","type":"journal-article","created":{"date-parts":[[2015,10,5]],"date-time":"2015-10-05T13:50:06Z","timestamp":1444053006000},"page":"1505-1518","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic graph partitioning: quadratic versus SOCP formulations"],"prefix":"10.1007","volume":"10","author":[{"given":"Dang Phuong","family":"Nguyen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Minoux","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viet Hung","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thanh Hai","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renaud","family":"Sirdey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,10,5]]},"reference":[{"issue":"2","key":"953_CR1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F Barahona","year":"1986","unstructured":"Barahona, F., Mahjoub, A.R.: On the cut polytope. Math. Program. 36(2), 157\u2013173 (1986)","journal-title":"Math. Program."},{"key":"953_CR2","doi-asserted-by":"crossref","unstructured":"Barbu, A., Zhu, S.: Graph partition by Swendsen\u2013Wang cuts. In: Ninth IEEE International Conference on Computer Vision, 2003. Proceedings, vol. 1, pp. 320\u2013327 (2003)","DOI":"10.1109\/ICCV.2003.1238362"},{"key":"953_CR3","doi-asserted-by":"crossref","unstructured":"Bonami, P., Nguyen, V.H., Klein, M., Minoux, M.: On the solution of a graph partitioning problem under capacity constraints. In: Mahjoub, A.R., Markakis, V., Milis, I., Paschos, V.Th. (eds.) ISCO. Lecture Notes in Computer Science, vol. 7422, pp. 285\u2013296. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-32147-4_26"},{"issue":"1","key":"953_CR4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1287\/mnsc.6.1.73","volume":"6","author":"A Charnes","year":"1959","unstructured":"Charnes, A., Cooper, W.W.: Chance-constrained programming. Manag. Sci. 6(1), 73\u201379 (1959)","journal-title":"Manag. Sci."},{"issue":"1\u20133","key":"953_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01581239","volume":"59","author":"S Chopra","year":"1993","unstructured":"Chopra, S., Rao, M.R.: The partition problem. Math. Program. 59(1\u20133), 87\u2013115 (1993)","journal-title":"Math. Program."},{"issue":"1","key":"953_CR6","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0166-218X(93)E0175-X","volume":"61","author":"S Chopra","year":"1995","unstructured":"Chopra, S., Rao, M.R.: Facets of the k-partition polytope. Discret. Appl. Math. 61(1), 27\u201348 (1995)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"953_CR7","doi-asserted-by":"crossref","first-page":"968","DOI":"10.1214\/aoms\/1177692559","volume":"43","author":"WJ Cocke","year":"1972","unstructured":"Cocke, W.J.: Central limit theorems for sums of dependent vector variables. Ann. Math. Stat. 43(3), 968\u2013976 (1972)","journal-title":"Ann. Math. Stat."},{"issue":"1\u20133","key":"953_CR8","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF01580897","volume":"56","author":"M Deza","year":"1992","unstructured":"Deza, M., Laurent, M.: Facets for the cut cone i. Math. Program. 56(1\u20133), 121\u2013160 (1992)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"953_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/BF01580898","volume":"56","author":"M Deza","year":"1992","unstructured":"Deza, M., Laurent, M.: Facets for the cut cone ii: clique-web inequalities. Math. Program. 56(1\u20133), 161\u2013188 (1992)","journal-title":"Math. Program."},{"key":"953_CR10","doi-asserted-by":"crossref","unstructured":"Fan, N., Zheng, Q.P., Pardalos, P.M.: On the two-stage stochastic graph partitioning problem. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) Combinatorial Optimization and Applications. Lecture Notes in Computer Science, vol. 6831, pp. 500\u2013509. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-22616-8_39"},{"issue":"1","key":"953_CR11","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/BF01218878","volume":"40","author":"W Feller","year":"1936","unstructured":"Feller, W.: ber den zentralen grenzwertsatz der wahrscheinlichkeitsrechnung. Mathematische Zeitschrift 40(1), 521\u2013559 (1936)","journal-title":"Mathematische Zeitschrift"},{"issue":"2","key":"953_CR12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01581107","volume":"81","author":"CE Ferreira","year":"1998","unstructured":"Ferreira, C.E., Martin, A., de Souza, C.C., Weismantel, R., Wolsey, L.A.: The node capacitated graph partitioning problem: a computational study. Math. Program. 81(2), 229\u2013256 (1998)","journal-title":"Math. Program."},{"issue":"2","key":"953_CR13","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF03006558","volume":"11","author":"R Fortet","year":"1960","unstructured":"Fortet, R.: L\u2019alg\u00e8bre de boole et ses applications en recherche operationnelle. Trabajos de Estadistica 11(2), 111\u2013118 (1960)","journal-title":"Trabajos de Estadistica"},{"issue":"2\u20133","key":"953_CR14","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10107-005-0620-5","volume":"104","author":"A Frangioni","year":"2005","unstructured":"Frangioni, A., Lodi, A., Rinaldi, G.: New approaches for optimizing over the semimetric polytope. Math. Program. 104(2\u20133), 375\u2013388 (2005)","journal-title":"Math. Program."},{"key":"953_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"953_CR16","doi-asserted-by":"crossref","unstructured":"Goldschmidt, O., Laugier, A., Olinick, E.A.: SONET\/SDH ring assignment with capacity constraints. Discret. Appl. Math. 129(1), 99\u2013128 (2003). Algorithmic Aspects of Communication","DOI":"10.1016\/S0166-218X(02)00236-6"},{"key":"953_CR17","unstructured":"Karypis, G., Kumar, V.: MeTis: Unstructured Graph Partitioning and Sparse Matrix Ordering System, Version 4.0 (2009)"},{"issue":"24","key":"953_CR18","doi-asserted-by":"crossref","first-page":"3473","DOI":"10.1016\/j.disc.2010.08.009","volume":"310","author":"M Labb\u00e9","year":"2010","unstructured":"Labb\u00e9, M., \u00d6zsoy, F.A.: Size-constrained graph partitioning polytopes. Discret. Math. 310(24), 3473\u20133493 (2010)","journal-title":"Discret. Math."},{"issue":"1","key":"953_CR19","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01494395","volume":"15","author":"JW Lindeberg","year":"1922","unstructured":"Lindeberg, J.W.: Eine neue herleitung des exponentialgesetzes in der wahrscheinlichkeitsrechnung. Mathematische Zeitschrift 15(1), 211\u2013225 (1922)","journal-title":"Mathematische Zeitschrift"},{"key":"953_CR20","unstructured":"Liapunov, A.M.: Collected Works of Academician A.M. Lyapunov. Number v. 1-2 in Collected Works of Academician A.M. Lyapunov. Translation Division, Foreign Technology Division (1967)"},{"key":"953_CR21","doi-asserted-by":"crossref","unstructured":"Lobo, M.S., Vandenberghe, L., Boyd, S., Lebret, H.: Applications of second-order cone programming. Linear Algebra Appl. 284(13), 193\u2013228 (1998). International Linear Algebra Society (ILAS) Symposium on Fast Algorithms for Control, Signals and Image Processing","DOI":"10.1016\/S0024-3795(98)10032-0"},{"key":"953_CR22","unstructured":"Nguyen, D.P., Minoux, M., Nguyen, V.H., Nguyen, T.H., Sirdey, R.: Improved compact formulations for graph partitioning in sparse graphs. Published on Optimization Online, manuscript 2015-06-4972 (2015)"},{"issue":"1","key":"953_CR23","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11590-006-0019-0","volume":"1","author":"HD Sherali","year":"2007","unstructured":"Sherali, H.D., Smith, J.C.: An improved linearization strategy for zero-one quadratic programming problems. Optim. Lett. 1(1), 33\u201347 (2007)","journal-title":"Optim. Lett."},{"issue":"2","key":"953_CR24","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/j.disopt.2006.08.001","volume":"4","author":"MM S\u00f8rensen","year":"2007","unstructured":"S\u00f8rensen, M.M.: Facet-defining inequalities for the simple graph partitioning polytope. Discret. Optim. 4(2), 221\u2013231 (2007)","journal-title":"Discret. Optim."},{"issue":"3","key":"953_CR25","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10732-014-9241-6","volume":"20","author":"O Stan","year":"2014","unstructured":"Stan, O., Sirdey, R., Carlier, J., Nace, D.: The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks. J. Heuristics 20(3), 261\u2013290 (2014)","journal-title":"J. Heuristics"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0953-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0953-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0953-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:43Z","timestamp":1559409103000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0953-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,5]]},"references-count":25,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["953"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0953-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,5]]}}}