{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T01:26:30Z","timestamp":1768526790761,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,3,9]],"date-time":"2014-03-09T00:00:00Z","timestamp":1394323200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10732-014-9241-6","type":"journal-article","created":{"date-parts":[[2014,3,8]],"date-time":"2014-03-08T12:47:20Z","timestamp":1394282840000},"page":"261-290","source":"Crossref","is-referenced-by-count":4,"title":["The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks"],"prefix":"10.1007","volume":"20","author":[{"given":"Oana","family":"Stan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renaud","family":"Sirdey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Carlier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dritan","family":"Nace","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,9]]},"reference":[{"key":"9241_CR1","doi-asserted-by":"crossref","unstructured":"Aringhieri, R.: Solving chance-constrained programs combining tabu search and simulation. In: Proceedings of the 3rd International Workshop on Experimental and Efficient Algorithms (WEA04). Lecture Notes in Computer Science, vol. 3059, pp. 30\u201341. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-24838-5_3"},{"key":"9241_CR2","unstructured":"Barbu, A., Zhu, S.-C.: Stochastic graph partition: generalizing the Swendsen\u2013Wang method. Technical Report Paper 2003010120, UCLA Department of Statistics (2003)"},{"key":"9241_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Oper. Res. Lett. 25, 1\u201313 (1999)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"9241_CR4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.ejor.2004.02.027","volume":"167","author":"P Beraldi","year":"2005","unstructured":"Beraldi, P., Ruszczynski, A.: Beam search heuristic to solve stochastic integer problems under probabilistic constraints. Eur. J. Oper. Res. 167(1), 35\u201347 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"9241_CR5","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)"},{"issue":"2","key":"9241_CR6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s11047-008-9098-4","volume":"8","author":"L Bianchi","year":"2006","unstructured":"Bianchi, L., Dorigo, M., Gambardella, L., Gutjahr, W.: A survey on metaheuristics for stochastic combinatorial optimization. Nat Comput 8(2), 239\u2013287 (2006)","journal-title":"Nat Comput"},{"issue":"3","key":"9241_CR7","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10852-007-9059-4","volume":"6","author":"CH Bichot","year":"2007","unstructured":"Bichot, C.H.: A new method, the fusion fission, for the relaxed-way graph partitioning problem, and comparisons with some multilevel algorithms. J. Math. Model. Algorithms 6(3), 319\u2013344 (2007)","journal-title":"J. Math. Model. Algorithms"},{"key":"9241_CR8","volume-title":"Partitionnement de graphe","author":"C Bichot","year":"2010","unstructured":"Bichot, C., Durand, N.: Partitionnement de graphe. Lavoisier, Paris (2010)"},{"key":"9241_CR9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-003-0499-y","volume":"102","author":"G Calafiore","year":"2005","unstructured":"Calafiore, G., Campi, M.: Uncertain convex programs: randomized solutions and confidence levels. Math. Program. 102, 25\u201346 (2005)","journal-title":"Math. Program."},{"issue":"5","key":"9241_CR10","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/TAC.2006.875041","volume":"51","author":"G Calafiore","year":"2006","unstructured":"Calafiore, G., Campi, M.: The scenario approach to robust control design. IEEE Trans. Automat. Control 51(5), 742\u2013753 (2006)","journal-title":"IEEE Trans. Automat. Control"},{"issue":"3","key":"9241_CR11","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1287\/mnsc.4.3.235","volume":"4","author":"A Charnes","year":"1958","unstructured":"Charnes, A., Cooper, W.W., Symonds, G.H.: Cost horizons and certainty equivalents: an approach to stochastic programming of heating oil. Manag. Sci. 4(3), 235\u2013263 (1958)","journal-title":"Manag. Sci."},{"key":"9241_CR12","unstructured":"David, V., Fraboul, C., Rousselot, J.Y., Siron, P.: Etude et realisation d\u2019une architecture modulaire et reconfigurable: Projet MODULOR. Technical Report, 1\/3364\/DERI.ONERA (1991)"},{"key":"9241_CR13","doi-asserted-by":"crossref","unstructured":"de Farias, D., Van Roy, B.: On constraint sampling in the linear programming approach to approximate linear programming. In: Proceedings of the 42nd IEEE Conference on Decision and Control, vol. 3, pp. 2441\u20132446 (2003)","DOI":"10.1109\/CDC.2003.1272986"},{"key":"9241_CR14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(95)00060-7","volume":"158","author":"M Demange","year":"1996","unstructured":"Demange, M., Paschos, V.: On an approximation measure founded on the links between optimization and polynomial approximation theory. Theor. Comput. Sci. 158, 117\u2013141 (1996)","journal-title":"Theor. Comput. Sci."},{"key":"9241_CR15","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/PL00011393","volume":"89","author":"D Dentcheva","year":"2000","unstructured":"Dentcheva, D., Pr\u00e9kopa, A., Ruszczynski, A.: Concavity and efficient points of discrete distributions in probabilistic programming. Math. Program. 89, 55\u201377 (2000)","journal-title":"Math. Program."},{"key":"9241_CR16","doi-asserted-by":"crossref","DOI":"10.1201\/9780429246593","volume-title":"An Introduction to the Bootstrap","author":"B Efron","year":"1994","unstructured":"Efron, B., Tibshirani, R.: An Introduction to the Bootstrap. CRC Press, Boca Raton (1994)"},{"key":"9241_CR17","unstructured":"Elsner, U.: Graph partitioning\u2014a survey. Technical Report, TU Chemnitz SFB393\/97-27 (1997)"},{"key":"9241_CR18","doi-asserted-by":"crossref","unstructured":"Fan, N., Pardalos, P.: Robust optimization of graph partitioning and critical node detection in analyzing networks. In: Proceedings of the 4th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2010), pp. 170\u2013183 (2010)","DOI":"10.1007\/978-3-642-17458-2_15"},{"key":"9241_CR19","doi-asserted-by":"crossref","unstructured":"Fan, N., Zheng, Q., Pardalos, P.: On the two-stage stochastic graph partitioning problem. In: Proceedings of the 5th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2011), pp. 500\u2013509 (2011)","DOI":"10.1007\/978-3-642-22616-8_39"},{"key":"9241_CR20","first-page":"229","volume":"81","author":"CE Ferreira","year":"1998","unstructured":"Ferreira, C.E., Martin, A., de Souza, C., Weismantel, R., Wolsey, L.: The node capacitated graph partitioning problem: a computational study. Math. Program. 81, 229\u2013256 (1998)","journal-title":"Math. Program."},{"key":"9241_CR21","doi-asserted-by":"crossref","unstructured":"Fiduccia, C.M., Mattheyses, R.M.: A linear-time heuristic for improving network partitions. In: Proceedings of the 19th Design Automation Conference. DAC \u201982, pp. 175\u2013181. IEEE Press, Piscataway (1982)","DOI":"10.1109\/DAC.1982.1585498"},{"key":"9241_CR22","first-page":"10","volume":"3","author":"PO Fj\u00e4llstr\u00f6m","year":"1998","unstructured":"Fj\u00e4llstr\u00f6m, P.O.: Algorithms for graph partitioning: a survey. Link\u00f6ping Electron. Articles Comput. Inf. Sci. 3, 10 (1998)","journal-title":"Link\u00f6ping Electron. Articles Comput. Inf. Sci."},{"key":"9241_CR23","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10898-010-9566-0","volume":"49","author":"A Gaivoronski","year":"2011","unstructured":"Gaivoronski, A., Lisser, A., Lopez, R., Xu, H.: Knapsack problem with probability constraints. J. Glob. Optim. 49, 397\u2013413 (2011)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"9241_CR24","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"M Garey","year":"1976","unstructured":"Garey, M., Johnson, D., Stockmeyer, L.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"9241_CR25","doi-asserted-by":"crossref","unstructured":"Hendrickson, B., Leland, R.: A multilevel algorithm for partitioning graphs. In: Proceedings of the 1995 ACM\/IEEE Conference on Supercomputing (CDROM). ACM, New York (1995)","DOI":"10.1145\/224170.224228"},{"issue":"6","key":"9241_CR26","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","volume":"37","author":"D Johnson","year":"1989","unstructured":"Johnson, D., Aragon, C., McGeoch, L., Schevon, C.: Optimization by simulated annealing: an experimental evaluation; part i, graph partitioning. Oper. Res. 37(6), 865\u2013892 (1989)","journal-title":"Oper. Res."},{"key":"9241_CR27","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01585164","volume":"62","author":"E Johnson","year":"1993","unstructured":"Johnson, E., Mehrotra, A., Nemhauser, G.L.: Min-cut clustering. Math. Program. 62, 133\u2013151 (1993)","journal-title":"Math. Program."},{"key":"9241_CR28","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G Karypis","year":"1998","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. Sci. Comput. 20, 359\u2013392 (1998)","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"9241_CR29","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B Kernighan","year":"1970","unstructured":"Kernighan, B., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49(1), 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"9241_CR30","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1007\/BF01009452","volume":"34","author":"S Kirkpatrick","year":"1984","unstructured":"Kirkpatrick, S.: Optimization by simulated annealing: quantitative studies. J. Stat. Phys. 34, 975\u2013986 (1984)","journal-title":"J. Stat. Phys."},{"key":"9241_CR31","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. 95, 91\u2013101 (2003)","journal-title":"Math. Program."},{"key":"9241_CR32","unstructured":"Loughlin, D.H., Ranjithan, S.: Chance-constrained genetic algorithms. In: GECCO-99: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 369\u2013376 (1999)"},{"key":"9241_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(98)00006-6","volume":"22","author":"A Mehrotra","year":"1997","unstructured":"Mehrotra, A., Trick, M.: Cliques and clustering: a combinatorial approach. Oper. Res. Lett. 22, 1\u201312 (1997)","journal-title":"Oper. Res. Lett."},{"key":"9241_CR34","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/s10957-009-9523-6","volume":"142","author":"BK Pagnoncelli","year":"2009","unstructured":"Pagnoncelli, B.K., Ahmed, S., Shapiro, A., Pardalos, P.M.: Sample average approximation method for chance constrained programming: theory and applications. J. Optim. Theory Appl. 142, 399\u2013416 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"9241_CR35","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-3087-7","volume-title":"Stochastic Programming","author":"A Prekopa","year":"1995","unstructured":"Prekopa, A.: Stochastic Programming. Kluwer Academic Publishers, Dordrecht (1995)"},{"key":"9241_CR36","first-page":"391","volume-title":"Lecture Notes in Computer Science","author":"N Sensen","year":"2001","unstructured":"Sensen, N.: Lower bounds and exact algorithms for the graph partitioning problem using multicommodity flows. In: Meyer auF der Heide, F. (ed.) Lecture Notes in Computer Science, vol. 2161, pp. 391\u2013403. Springer, Berlin (2001)"},{"key":"9241_CR37","unstructured":"Sirdey, R., David, V.: Approches heuristiques des probl\u00e8mes de partitionnement, placement et routage de r\u00e8seaux de processus sur architectures parall\u00e8les clusteris\u00e9es. Technical Report, CEA LIST DTSI\/SARC\/09-470\/RS (2009)"},{"key":"9241_CR38","unstructured":"Stan, O., Sirdey, R., Carlier, J., Nace, D.: A heuristic algorithm for stochastic partitioning of process networks. In: ICSTCC (2012)"},{"key":"9241_CR39","unstructured":"Tanner, M.W., Beier, E.B.: A general heuristic method for joint chance-constrained stochastic programs with discretely distributed parameters (2007). http:\/\/www.optimization-online.org\/DB_HTML\/2007\/08\/1755.html"},{"issue":"4","key":"9241_CR40","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/j.disopt.2009.05.004","volume":"6","author":"ZC Taskin","year":"2009","unstructured":"Taskin, Z.C., Smith, J.C., Ahmed, S., Schaefer, A.: Cutting plane algorithms for solving a stochastic edge-partition problem. Discret. Optim. 6(4), 420\u2013435 (2009)","journal-title":"Discret. Optim."},{"key":"9241_CR41","doi-asserted-by":"crossref","unstructured":"Vidyasagar, M.: Randomized algorithms for robust controller synthesis using statistical learning theory. In: Learning Control and Hybrid Systems. Lecture Notes in Control and Information Sciences, vol. 241, pp. 3\u201324. Springer, Berlin (1999)","DOI":"10.1007\/BFb0109718"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9241-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-014-9241-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9241-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T00:49:59Z","timestamp":1746146999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-014-9241-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,9]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["9241"],"URL":"https:\/\/doi.org\/10.1007\/s10732-014-9241-6","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,9]]}}}