{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:27:13Z","timestamp":1648618033566},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,4,30]],"date-time":"2013-04-30T00:00:00Z","timestamp":1367280000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10589-013-9562-7","type":"journal-article","created":{"date-parts":[[2013,4,30]],"date-time":"2013-04-30T23:45:16Z","timestamp":1367365516000},"page":"343-368","source":"Crossref","is-referenced-by-count":1,"title":["Implementing the simplex method as a cutting-plane method, with a view to regularization"],"prefix":"10.1007","volume":"56","author":[{"given":"Csaba I.","family":"F\u00e1bi\u00e1n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olga","family":"Papp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kriszti\u00e1n","family":"Eretnek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,4,30]]},"reference":[{"key":"9562_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1287\/opre.50.1.3.17780","volume":"50","author":"R.E. Bixby","year":"2002","unstructured":"Bixby, R.E.: Solving real-world linear programs: a decade and more of progress. Oper. Res. 50, 3\u201315 (2002)","journal-title":"Oper. Res."},{"key":"9562_CR2","series-title":"Algorithms and Combinatorics","volume-title":"The Simplex Method: A Probabilistic Analysis","author":"K.H. Borgwardt","year":"1980","unstructured":"Borgwardt, K.H.: The Simplex Method: A Probabilistic Analysis. Algorithms and Combinatorics, vol.\u00a01. Springer, New York (1980)"},{"key":"9562_CR3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BF01386389","volume":"1","author":"E.W. Cheney","year":"1959","unstructured":"Cheney, E.W., Goldstein, A.A.: Newton\u2019s method for convex programming and Tchebycheff approximation. Numer. Math. 1, 253\u2013268 (1959)","journal-title":"Numer. Math."},{"key":"9562_CR4","first-page":"339","volume-title":"Activity Analysis of Production and Allocation","author":"G.B. Dantzig","year":"1951","unstructured":"Dantzig, G.B.: Maximization of a linear function of variables subject to linear inequalities. In: Koopmans, T.C. (ed.) Activity Analysis of Production and Allocation, pp. 339\u2013347. Wiley, New York (1951)"},{"key":"9562_CR5","doi-asserted-by":"crossref","DOI":"10.1515\/9781400884179","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1963)"},{"key":"9562_CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0022-0000(67)80015-1","volume":"1","author":"G.B. Dantzig","year":"1967","unstructured":"Dantzig, G.B., Van Slyke, R.M.: Generalized upper bounding techniques. J. Comput. Syst. Sci. 1, 213\u2013226 (1967)","journal-title":"J. Comput. Syst. Sci."},{"key":"9562_CR7","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1137\/0732028","volume":"32","author":"M.A.H. Dempster","year":"1995","unstructured":"Dempster, M.A.H., Merkovsky, R.R.: A practical geometrically convergent cutting plane algorithm. SIAM J. Numer. Anal. 32, 631\u2013644 (1995)","journal-title":"SIAM J. Numer. Anal."},{"key":"9562_CR8","unstructured":"Elble, J.M.: Computational experience with linear optimization and related problems. PhD dissertation, advisor: N. Sahinidis. The University of Illinois at Urbana-Champaign, Illinois, USA"},{"key":"9562_CR9","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1007\/BF01580439","volume":"8","author":"J. Elzinga","year":"1975","unstructured":"Elzinga, J., Moore, T.G.: A central cutting plane algorithm for the convex programming problem. Math. Program. 8, 134\u2013145 (1975)","journal-title":"Math. Program."},{"key":"9562_CR10","first-page":"35","volume":"8","author":"C.I. F\u00e1bi\u00e1n","year":"2000","unstructured":"F\u00e1bi\u00e1n, C.I.: Bundle-type methods for inexact data. Cent. Eur. J. Oper. Res. 8, 35\u201355 (2000) (special issue, T. Csendes, T. Rapcs\u00e1k (eds.))","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"9562_CR11","unstructured":"F\u00e1bi\u00e1n, C.I.: Computational aspects of risk-averse optimisation in two-stage stochastic models. Optimization Online, August 2012"},{"key":"9562_CR12","series-title":"DSOR Contributions to Information Sytems","first-page":"3","volume-title":"Applied Mathematical Optimization and Modelling. Extended Abstracts of the APMOD 2012 Conference","author":"C.I. F\u00e1bi\u00e1n","year":"2012","unstructured":"F\u00e1bi\u00e1n, C.I., Eretnek, K., Papp, O.: 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. DSOR Contributions to Information Sytems, vol. 8, pp. 3\u20139 (2012) (DS&OR Lab, University of Paderborn, Germany)"},{"key":"9562_CR13","unstructured":"F\u00e1bi\u00e1n, C.I., Eretnek, K., Papp, O.: A regularised simplex method. Optimization Online, February 2012"},{"key":"9562_CR14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-009-0326-1","volume":"130","author":"C.I. F\u00e1bi\u00e1n","year":"2011","unstructured":"F\u00e1bi\u00e1n, C.I., Mitra, G., Roman, D.: Processing second-order stochastic dominance models using cutting-plane representations. Math. Program., Ser. A 130, 33\u201357 (2011)","journal-title":"Math. Program., Ser. A"},{"key":"9562_CR15","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1080\/1055678021000033973","volume":"17","author":"C.I. F\u00e1bi\u00e1n","year":"2002","unstructured":"F\u00e1bi\u00e1n, C.I., Pr\u00e9kopa, A., Ruf-Fiedler, O.: On a dual method for a specially structured linear programming problem. Optim. Methods Softw. 17, 445\u2013492 (2002)","journal-title":"Optim. Methods Softw."},{"key":"9562_CR16","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/s10287-006-0026-8","volume":"4","author":"C.I. F\u00e1bi\u00e1n","year":"2007","unstructured":"F\u00e1bi\u00e1n, C.I., Sz\u0151ke, Z.: Solving two-stage stochastic programming problems with level decomposition. Comput. Manag. Sci. 4, 313\u2013353 (2007)","journal-title":"Comput. Manag. Sci."},{"key":"9562_CR17","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01581089","volume":"57","author":"J.J. Forrest","year":"1992","unstructured":"Forrest, J.J., Goldfarb, D.: Steepest edge simplex algorithms for linear programming. Math. Program. 57, 341\u2013374 (1992)","journal-title":"Math. Program."},{"key":"9562_CR18","unstructured":"Fourer, R.: Notes on the dual simplex method. Draft report (1994)"},{"key":"9562_CR19","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/mnsc.38.2.284","volume":"38","author":"J.-L. Goffin","year":"1992","unstructured":"Goffin, J.-L., Haurie, A., Vial, J.-P.: Decomposition and nondifferentiable optimization with the projective algorithm. Manag. Sci. 38, 284\u2013302 (1992)","journal-title":"Manag. Sci."},{"key":"9562_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580108","volume":"5","author":"P.M.J. Harris","year":"1973","unstructured":"Harris, P.M.J.: Pivot selection methods of the DEVEX LP code. Math. Program. 5, 1\u201328 (1973)","journal-title":"Math. Program."},{"key":"9562_CR21","series-title":"International Series in Operations Research & Management Science.","volume-title":"Stochastic Linear Programming. Models, Theory, and Computation","author":"P. Kall","year":"2005","unstructured":"Kall, P., Mayer, J.: Stochastic Linear Programming. Models, Theory, and Computation. International Series in Operations Research & Management Science. Springer, Berlin (2005)"},{"key":"9562_CR22","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1137\/0108053","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"Kelley, J.E.: The cutting-plane method for solving convex programs. J. Soc. Ind. Appl. Math. 8, 703\u2013712 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"9562_CR23","first-page":"89","volume":"69","author":"K.C. Kiwiel","year":"1995","unstructured":"Kiwiel, K.C.: Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities. Math. Program. 69, 89\u2013109 (1995)","journal-title":"Math. Program."},{"key":"9562_CR24","first-page":"159","volume-title":"Inequalities III","author":"V. Klee","year":"1972","unstructured":"Klee, V., Minty, G.J.: How good is the simplex algorithm? In: Shisha, O. (ed.) Inequalities III, pp.\u00a0159\u2013175. Academic Press, San Diego (1972)"},{"key":"9562_CR25","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10287-005-0007-3","volume":"3","author":"W.K. Klein Haneveld","year":"2006","unstructured":"Klein Haneveld, W.K., van der Vlerk, M.H.: Integrated chance constraints: reduced forms and an algorithm. Comput. Manag. Sci. 3, 245\u2013269 (2006)","journal-title":"Comput. Manag. Sci."},{"key":"9562_CR26","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s10589-008-9207-4","volume":"41","author":"A. Koberstein","year":"2008","unstructured":"Koberstein, A.: Progress in the dual simplex algorithm for solving large scale LP problems: techniques for a fast and stable implementation. Comput. Optim. Appl. 41, 185\u2013204 (2008)","journal-title":"Comput. Optim. Appl."},{"key":"9562_CR27","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/s10589-007-9022-3","volume":"37","author":"A. Koberstein","year":"2007","unstructured":"Koberstein, A., Suhl, U.H.: Progress in the dual simplex algorithm for solving large scale LP problems: practical dual phase 1 algorithms. Comput. Optim. Appl. 37, 49\u201365 (2007)","journal-title":"Comput. Optim. Appl."},{"key":"9562_CR28","volume-title":"Linear Inequalities and Related Systems","year":"1956","unstructured":"Kuhn, H.W., Tucker, A.W. (eds.): Linear Inequalities and Related Systems. Princeton University Press, Princeton (1956)"},{"key":"9562_CR29","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10287-005-0042-0","volume":"3","author":"A. K\u00fcnzi-Bay","year":"2006","unstructured":"K\u00fcnzi-Bay, A., Mayer, J.: Computational aspects of minimizing conditional value-at-risk. Comput. Manag. Sci. 3, 3\u201327 (2006)","journal-title":"Comput. Manag. Sci."},{"key":"9562_CR30","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01585555","volume":"69","author":"C. Lemar\u00e9chal","year":"1995","unstructured":"Lemar\u00e9chal, C., Nemirovskii, A., Nesterov, Yu.: New variants of bundle methods. Math. Program. 69, 111\u2013147 (1995)","journal-title":"Math. Program."},{"key":"9562_CR31","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1002\/nav.3800010107","volume":"1","author":"C.E. Lemke","year":"1954","unstructured":"Lemke, C.E.: The dual method of solving the linear programming problem. Nav. Res. Logist. Q. 1, 36\u201347 (1954)","journal-title":"Nav. Res. Logist. Q."},{"key":"9562_CR32","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1137\/070707956","volume":"19","author":"J. Luedtke","year":"2008","unstructured":"Luedtke, J.: New formulations for optimization under stochastic dominance constraints. SIAM J. Control Optim. 19, 1433\u20131450 (2008)","journal-title":"SIAM J. Control Optim."},{"key":"9562_CR33","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(02)00448-4","volume":"149","author":"I. Maros","year":"2003","unstructured":"Maros, I.: A generalized dual phase-2 simplex algorithm. Eur. J. Oper. Res. 149, 1\u201316 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9562_CR34","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1025102305440","volume":"26","author":"I. Maros","year":"2003","unstructured":"Maros, I.: A piecewise linear dual phase-1 algorithm for the simplex method. Comput. Optim. Appl. 26, 63\u201381 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"9562_CR35","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1023\/B:ANOR.0000004769.36807.cf","volume":"124","author":"I. Maros","year":"2003","unstructured":"Maros, I.: A general pricing scheme for the simplex method. Ann. Oper. Res. 124, 193\u2013203 (2003)","journal-title":"Ann. Oper. Res."},{"key":"9562_CR36","series-title":"International Series in Operations Research & Management Science.","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0257-9","volume-title":"Computational Techniques of the Simplex Method","author":"I. Maros","year":"2003","unstructured":"Maros, I.: Computational Techniques of the Simplex Method. International Series in Operations Research & Management Science. Kluwer Academic, Boston (2003)"},{"key":"9562_CR37","unstructured":"Oliveira, W., Sagastiz\u00e1bal, C.: Level bundle methods for oracles with on-demand accuracy. Optimization Online (2012)"},{"key":"9562_CR38","doi-asserted-by":"crossref","first-page":"1184","DOI":"10.1287\/opre.1110.0951","volume":"59","author":"M.R. Oskoorouchi","year":"2011","unstructured":"Oskoorouchi, M.R., Ghaffari, H.R., Terlaky, T., Aleman, D.M.: An interior point constraint generation algorithm for semi-infinite optimization with health-care application. Oper. Res. 59, 1184\u20131197 (2011)","journal-title":"Oper. Res."},{"key":"9562_CR39","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10107-008-0209-x","volume":"119","author":"A. Ouorou","year":"2009","unstructured":"Ouorou, A.: A proximal cutting plane method using Chebychev center for nonsmooth convex optimization. Math. Program. 119, 239\u2013271 (2009)","journal-title":"Math. Program."},{"key":"9562_CR40","volume-title":"Linear Optimization and Extensions","author":"M. Padberg","year":"1995","unstructured":"Padberg, M.: Linear Optimization and Extensions. Springer, Berlin (1995)"},{"key":"9562_CR41","unstructured":"Pan, P.-Q.: Nested pricing for the simplex algorithm: an empirical evaluation. Optimization Online (2007)"},{"key":"9562_CR42","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.: Efficient nested pricing in the simplex algorithm. Oper. Res. Lett. 36, 309\u2013313 (2008)","journal-title":"Oper. Res. Lett."},{"key":"9562_CR43","volume-title":"Linear Programming","author":"A. Pr\u00e9kopa","year":"1968","unstructured":"Pr\u00e9kopa, A.: Linear Programming. Bolyai J\u00e1nos Mathematical Society, Budapest (1968) (in Hungarian)"},{"key":"9562_CR44","unstructured":"Pr\u00e9kopa, A.: A very short introduction to linear programming. RUTCOR Lecture Notes, 2-92 (1992)"},{"key":"9562_CR45","unstructured":"Pr\u00e9kopa, A.: Private communication (2011)"},{"key":"9562_CR46","doi-asserted-by":"crossref","first-page":"1326","DOI":"10.1137\/070702473","volume":"19","author":"G. Rudolf","year":"2008","unstructured":"Rudolf, G., Ruszczy\u0144ski, A.: Optimization problems with second order stochastic dominance constraints: duality, compact formulations, and cut generation methods. SIAM J. Control Optim. 19, 1326\u20131343 (2008)","journal-title":"SIAM J. Control Optim."},{"key":"9562_CR47","series-title":"International Series of Numerical Mathematics","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/978-3-0348-9297-1_20","volume-title":"Trends in Mathematical Optimization: Proceedings of the 4th French-German Conference on Optimization","author":"G. Sonnevend","year":"1988","unstructured":"Sonnevend, G.: New algorithms in convex programming based on a notion of \u2018centre\u2019 (for systems of analytic inequalities) and on rational expectations. In: Hoffmann, K.H., Hirriart-Urruty, J.-B., Lemar\u00e9chal, C., Zowe, J. (eds.) Trends in Mathematical Optimization: Proceedings of the 4th French-German Conference on Optimization. International Series of Numerical Mathematics, vol.\u00a084, pp.\u00a0311\u2013327. Birkh\u00e4user, Basel (1988)"},{"key":"9562_CR48","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/990308.990310","volume":"51","author":"D.A. Spielman","year":"2004","unstructured":"Spielman, D.A., Teng, S.-H.: Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time. J. ACM 51, 385\u2013463 (2004)","journal-title":"J. ACM"},{"key":"9562_CR49","unstructured":"Terlaky, T.: Private communication (2010)"},{"key":"9562_CR50","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02096264","volume":"46","author":"T. Terlaky","year":"1993","unstructured":"Terlaky, T., Zhang, S.: Pivot rules for linear programming: a survey on recent theoretical developments. Ann. Oper. Res. 46, 203\u2013233 (1993)","journal-title":"Ann. Oper. Res."},{"key":"9562_CR51","series-title":"International Series in Operations Research & Management Science.","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5662-3","volume-title":"Linear Programming. Foundations and Extensions","author":"R.J. Vanderbei","year":"2001","unstructured":"Vanderbei, R.J.: Linear Programming. Foundations and Extensions. International Series in Operations Research & Management Science. Springer, Berlin (2001) (ibid. 2008)"},{"key":"9562_CR52","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, C.I., Ellison, E., Mitra, G.: A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition. Math. Program. Comput. 4, 211\u2013238 (2012)","journal-title":"Math. Program. Comput."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9562-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-013-9562-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9562-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:37:34Z","timestamp":1559241454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-013-9562-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,30]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9562"],"URL":"https:\/\/doi.org\/10.1007\/s10589-013-9562-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,30]]}}}