{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T19:32:58Z","timestamp":1765827178303},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","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":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s10100-014-0344-9","type":"journal-article","created":{"date-parts":[[2014,3,8]],"date-time":"2014-03-08T09:09:36Z","timestamp":1394269776000},"page":"877-898","source":"Crossref","is-referenced-by-count":2,"title":["A regularized simplex method"],"prefix":"10.1007","volume":"23","author":[{"given":"Csaba I.","family":"F\u00e1bi\u00e1n","sequence":"first","affiliation":[]},{"given":"Kriszti\u00e1n","family":"Eretnek","sequence":"additional","affiliation":[]},{"given":"Olga","family":"Papp","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,9]]},"reference":[{"key":"344_CR1","doi-asserted-by":"crossref","DOI":"10.1515\/9781400884179","volume-title":"Linear programming and extensions","author":"GB Dantzig","year":"1963","unstructured":"Dantzig GB (1963) Linear programming and extensions. Princeton University Press, Princeton"},{"key":"344_CR2","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/0732028","volume":"32","author":"MAH Dempster","year":"1995","unstructured":"Dempster MAH, Merkovsky RR (1995) A practical geometrically convergent cutting plane algorithm. SIAM J Numer Anal 32:631\u2013644","journal-title":"SIAM J Numer Anal"},{"key":"344_CR3","unstructured":"Elble JM (2010) Computational experience with linear optimization and related problems. PhD dissertation, advisor: N. Sahinidis. The University of Illinois at Urbana-Champaign, IL"},{"key":"344_CR4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/s10589-011-9420-4","volume":"52","author":"JM Elble","year":"2012","unstructured":"Elble JM, Sahinidis NV (2012) Scaling linear optimization problems prior to application of the simplex method. Comput Optim Appl 52:345\u2013371","journal-title":"Comput Optim Appl"},{"key":"344_CR5","unstructured":"F\u00e1bi\u00e1n CI (2012) Computational aspects of risk-averse optimisation in two-stage stochastic models. Optimization Online, Aug 2012"},{"key":"344_CR6","unstructured":"F\u00e1bi\u00e1n CI, Eretnek K, Papp O (2012) Towards a regularised simplex method. In: Suhl L, Mitra G, Lucas C, Koberstein A, Beckmann L (eds) Applied mathematical optimization and modelling. Extended abstracts of the APMOD 2012 conference. Volume 8 of the DSOR contributions to information sytems, pp 3\u20139. DS&OR Lab, University of Paderborn, Germany"},{"key":"344_CR7","doi-asserted-by":"crossref","first-page":"1525","DOI":"10.1080\/14697680903493607","volume":"11","author":"CI F\u00e1bi\u00e1n","year":"2011","unstructured":"F\u00e1bi\u00e1n CI, Mitra G, Roman D, Zverovich V (2011) An enhanced model for portfolio choice with SSD criteria: a constructive approach. Quant Financ 11:1525\u20131534","journal-title":"Quant Financ"},{"key":"344_CR8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/s10589-013-9562-7","volume":"56","author":"CI F\u00e1bi\u00e1n","year":"2013","unstructured":"F\u00e1bi\u00e1n CI, Papp O, Eretnek K (2013) Implementing the simplex method as a cutting-plane method, with a view to regularization. Computat Optim Appl 56:343\u2013368","journal-title":"Computat Optim Appl"},{"key":"344_CR9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s10287-006-0026-8","volume":"4","author":"CI F\u00e1bi\u00e1n","year":"2007","unstructured":"F\u00e1bi\u00e1n CI, Sz\u0151ke Z (2007) Solving two-stage stochastic programming problems with level decomposition. CMS 4:313\u2013353","journal-title":"CMS"},{"key":"344_CR10","unstructured":"Gondzio J, Gonz\u00e1lez-Brevis P, Munari P (2012) The primal-dual column generation method: integer optimization applications. In: Suhl L, Mitra G, Lucas C, Koberstein A, Beckmann L (eds) Applied mathematical optimization and modelling. Extended abstracts of the APMOD 2012 conference. Volume 8 of the DSOR contributions to information sytems, pp 54\u201357. DS&OR Lab, University of Paderborn, Germany"},{"key":"344_CR11","doi-asserted-by":"crossref","unstructured":"Lemar\u00e9chal C, Nemirovskii A, Nesterov Y (1995) New variants of bundle methods. Math Program 69: 111\u2013147","DOI":"10.1007\/BF01585555"},{"key":"344_CR12","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1021858008222","volume":"24","author":"J Linderoth","year":"2003","unstructured":"Linderoth J, Wright S (2003) Decomposition algorithms for stochastic programming on a computational grid. Comput Optim Appl 24:207\u2013250","journal-title":"Comput Optim Appl"},{"key":"344_CR13","doi-asserted-by":"crossref","unstructured":"Lumbreras S, Ramos A (2013) Transmission expansion planning using an efficient version of benders decomposition. A Case study. In: IEEE PES Grenoble PowerTech, Grenoble, France, pp 16\u201320","DOI":"10.1109\/PTC.2013.6652091"},{"key":"344_CR14","volume-title":"Computational techniques of the simplex method. International series in operations research and management science","author":"I Maros","year":"2003","unstructured":"Maros I (2003) Computational techniques of the simplex method. International series in operations research and management science. Kluwer Academic Publishers, Boston"},{"key":"344_CR15","volume-title":"Advanced linear programming: computation and practice","author":"BA Murtagh","year":"1981","unstructured":"Murtagh BA (1981) Advanced linear programming: computation and practice. McGraw-Hill, New York"},{"key":"344_CR16","unstructured":"Murty KG (1986) The gravitational method of linear programming. Technical Report No. 8619, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI"},{"key":"344_CR17","volume-title":"Lectures in modern convex optimization","author":"A Nemirovski","year":"2005","unstructured":"Nemirovski A (2005) Lectures in modern convex optimization. ISYE, Georgia Institute of Technology, Atlanda"},{"key":"344_CR18","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1137\/100808289","volume":"21","author":"WC Oliveira","year":"2011","unstructured":"Oliveira WC, Sagastiz\u00e1bal C, Scheimberg S (2011) Inexact bundle methods for two-stage stochastic programming. SIAM J Optim 21:517\u2013544","journal-title":"SIAM J Optim"},{"key":"344_CR19","volume-title":"Advanced linear-programming computing techniques","author":"W Orchard-Hays","year":"1968","unstructured":"Orchard-Hays W (1968) Advanced linear-programming computing techniques. McGraw-Hill, New York"},{"key":"344_CR20","unstructured":"Pan P-Q (2007) Nested pricing for the simplex algorithm: an empirical evaluation. Optimization Online, March 2007"},{"key":"344_CR21","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/j.orl.2007.10.001","volume":"36","author":"P-Q Pan","year":"2008","unstructured":"Pan P-Q (2008) Efficient nested pricing in the simplex algorithm. Oper Res Lett 36:309\u2013313","journal-title":"Oper Res Lett"},{"key":"344_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-3087-7","volume-title":"Stochastic programming","author":"A Pr\u00e9kopa","year":"1995","unstructured":"Pr\u00e9kopa A (1995) Stochastic programming. Kluwer Academic Publishers, Dordrecht"},{"key":"344_CR23","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/s10957-011-9908-1","volume":"152","author":"P Richt\u00e1rik","year":"2012","unstructured":"Richt\u00e1rik P (2012) Approximate level method for nonsmooth convex minimization. J Optim Theory Appl 152:334\u2013350","journal-title":"J Optim Theory Appl"},{"key":"344_CR24","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/BF01580883","volume":"35","author":"A Ruszczy\u0144ski","year":"1986","unstructured":"Ruszczy\u0144ski A (1986) A regularized decomposition method for minimizing a sum of polyhedral functions. Math Program 35:309\u2013333","journal-title":"Math Program"},{"key":"344_CR25","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/S0377-2217(96)00401-8","volume":"101","author":"A Ruszczy\u0144ski","year":"1997","unstructured":"Ruszczy\u0144ski A, \u015awi\u0229tanowski A (1997) Accelerating the regularized decomposition method for two-stage stochastic linear problems. Eur J Oper Res 101:328\u2013342","journal-title":"Eur J Oper Res"},{"key":"344_CR26","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10287-012-0139-1","volume":"9","author":"C Sagastiz\u00e1bal","year":"2012","unstructured":"Sagastiz\u00e1bal C, Solodov M (2012) Solving generation expansion problems with environmental constraints by a bundle method. Comput Manag Sci 9:163\u2013182","journal-title":"Comput Manag Sci"},{"key":"344_CR27","doi-asserted-by":"crossref","first-page":"602","DOI":"10.1137\/110850815","volume":"23","author":"H Sun","year":"2013","unstructured":"Sun H, Xu H, Meskarian R, Wang Y (2013) Exact penalization, level function method and modified cutting-plane method for stochastic programs with second order stochastic dominance constraints. SIAM J Optim 23:602\u2013631","journal-title":"SIAM J Optim"},{"key":"344_CR28","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02096264","volume":"46","author":"T Terlaky","year":"1993","unstructured":"Terlaky T, Zhang S (1993) Pivot rules for linear programming: a survey on recent theoretical developments. Ann Oper Res 46:203\u2013233","journal-title":"Ann Oper Res"},{"key":"344_CR29","unstructured":"Vespucci MT, Bertocchi M, Escudero L, Innorta M, Zigrino S (2012) A stochastic model for generation expansion planning in the long period with different risk measures. In: Suhl L, Mitra G, Lucas C, Koberstein A, Beckmann L (eds) Applied mathematical optimization and modelling. Extended abstracts of the APMOD 2012 conference. Volume 8 of the DSOR contributions to information sytems, pp 114\u2013121. DS&OR Lab, University of Paderborn, Germany"},{"key":"344_CR30","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/s12532-012-0038-z","volume":"4","author":"V Zverovich","year":"2012","unstructured":"Zverovich V, F\u00e1bi\u00e1n CI, Ellison F, Mitra G (2012) A computational study of a solver system for processing two-stage stochastic linear programming problems. Math Program Comput 4:211\u2013238","journal-title":"Math Program Comput"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0344-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-014-0344-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0344-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:49:32Z","timestamp":1559108972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-014-0344-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,9]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["344"],"URL":"https:\/\/doi.org\/10.1007\/s10100-014-0344-9","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,9]]}}}