{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T15:12:56Z","timestamp":1774624376329,"version":"3.50.1"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,3,14]],"date-time":"2007-03-14T00:00:00Z","timestamp":1173830400000},"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":[[2007,3,29]]},"DOI":"10.1007\/s10589-007-9022-3","type":"journal-article","created":{"date-parts":[[2007,3,13]],"date-time":"2007-03-13T20:09:49Z","timestamp":1173816589000},"page":"49-65","source":"Crossref","is-referenced-by-count":44,"title":["Progress in the dual simplex method for large scale LP problems: practical dual phase 1 algorithms"],"prefix":"10.1007","volume":"37","author":[{"given":"Achim","family":"Koberstein","sequence":"first","affiliation":[]},{"given":"Uwe H.","family":"Suhl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,3,14]]},"reference":[{"issue":"1","key":"9022_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(1), 3\u201315 (2002)","journal-title":"Oper. Res."},{"issue":"1","key":"9022_CR2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1287\/ijoc.12.1.45.11902","volume":"12","author":"R.E. Bixby","year":"2000","unstructured":"Bixby, R.E., Martin, A.: Parallelizing the dual simplex method. Informs J. Comput. 12(1), 45\u201356 (2000)","journal-title":"Informs J. Comput."},{"key":"9022_CR3","unstructured":"BPMPD test problems. http:\/\/www.sztaki.hu\/~meszaros\/bpmpd\/"},{"key":"9022_CR4","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01580428","volume":"15","author":"A.L. Brearley","year":"1975","unstructured":"Brearley, A.L., Mitra, G., Williams, H.P.: Analysis of mathematical programming problems prior to applying the simplex algorithm. Math. Program. 15, 54\u201383 (1975)","journal-title":"Math. Program."},{"issue":"2","key":"9022_CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"E.D. Dolan","year":"2002","unstructured":"Dolan, E.D., More, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"9022_CR6","unstructured":"DSOR test problems. http:\/\/dsor.upb.de\/koberstein\/lptestset\/"},{"issue":"3","key":"9022_CR7","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(3), 341\u2013374 (1992)","journal-title":"Math. Program."},{"key":"9022_CR8","unstructured":"Fourer, R.: Notes on the dual simplex method. Draft report (1994)"},{"issue":"3","key":"9022_CR9","first-page":"197","volume":"23","author":"R. Gabasov","year":"1979","unstructured":"Gabasov, R., Kirillova, F.M., Kostyukova, O.I.: A method of solving general linear programming problems. Doklady AN BSSR 23(3), 197\u2013200 (1979) (in Russian)","journal-title":"Doklady AN BSSR"},{"key":"9022_CR10","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0909058","volume":"9","author":"J.R. Gilbert","year":"1988","unstructured":"Gilbert, J.R., Peierls, T.: Sparse partial pivoting in time proportional to arithmetic operations. SIAM J. Sci. Stat. Comput. 9, 862\u2013874 (1988)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"9022_CR11","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF01589114","volume":"45","author":"P. Gill","year":"1989","unstructured":"Gill, P., Murray, W., Saunders, M., Wright, M.: A practical anti-cycling procedure for linearly constrained optimization. Math. Program. 45, 437\u2013474 (1989)","journal-title":"Math. Program."},{"key":"9022_CR12","doi-asserted-by":"crossref","unstructured":"Hall, J.A.J., Mc Kinnon, K.I.M.: Hyper-sparsity in the revised simplex method and how to exploit it. Comput. Math. Appl. (2005, to appear)","DOI":"10.1007\/s10589-005-4802-0"},{"key":"9022_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580108","volume":"5","author":"P. Harris","year":"1973","unstructured":"Harris, P.: Pivot selection method of the Devex LP code. Math. Program. 5, 1\u201328 (1973)","journal-title":"Math. Program."},{"key":"9022_CR14","unstructured":"ILOG: Cplex 9.0 reference manual (2003)"},{"key":"9022_CR15","unstructured":"Kliewer, N.: Optimierung des Fahrzeugeinsatzes im \u00f6ffentlichen Personennahverkehr: Modelle, Methoden und praktische Anwendungen. Dissertation at the University of Paderborn II, Fakult\u00e4t f\u00fcr Wirtschaftswissenschaften, Department Wirtschaftsinformatik (2005), http:\/\/ubdata.uni-paderborn.de\/ediss\/05\/2005\/kliewer\/"},{"key":"9022_CR16","unstructured":"Koberstein, A.: The Dual Simplex Method: Techniques for a fast and stable implementation. Dissertation at the University of Paderborn II, Fakult\u00e4t f\u00fcr Wirtschaftswissenschaften, Department Wirtschaftsinformatik (2005)"},{"key":"9022_CR17","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/s001860200188","volume":"55","author":"E. Kostina","year":"2002","unstructured":"Kostina, E.: The long step rule in the bounded-variable dual simplex method: numerical experiments. Math. Methods Oper. Res. 55, 413\u2013429 (2002)","journal-title":"Math. Methods Oper. Res."},{"key":"9022_CR18","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. Log. Q. 1, 36\u201347 (1954)","journal-title":"Nav. Res. Log. Q."},{"key":"9022_CR19","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/978-1-4757-2878-1_12","volume-title":"New Trends in Mathematical Programming","author":"I. Maros","year":"1998","unstructured":"Maros, I.: A piecewise linear dual procedure in mixed integer programming. In: Giannesi et al. (eds.) New Trends in Mathematical Programming, pp.\u00a0159\u2013170. Kluwer, Dordrecht (1998)"},{"key":"9022_CR20","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 with all types of variables. Comput. Optim. Appl. 26, 63\u201381 (2003)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9022_CR21","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), 1\u201316 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9022_CR22","series-title":"Kluwer International Series","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. Kluwer International Series. Kluwer, Dordrecht (2003) ISBN 1-4020-7332-1"},{"issue":"2","key":"9022_CR23","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.9.2.154","volume":"9","author":"R.D. McBride","year":"1997","unstructured":"McBride, R.D., Mamer, J.W.: Solving multicommodity flow problems with a primal embedded network simplex algorithm. INFORMS J. Comput. 9(2), 154\u2013163 (1997)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"9022_CR24","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/s00291-003-0130-x","volume":"25","author":"C. M\u00e9sz\u00e1ros","year":"2003","unstructured":"M\u00e9sz\u00e1ros, C., Suhl, U.H.: Advanced preprocessing techniques for linear and quadratic programming. OR Spectrum 25(4), 575\u2013595 (2003)","journal-title":"OR Spectrum"},{"key":"9022_CR25","unstructured":"MipLib 2003 test problems. http:\/\/miplib.zib.de\/"},{"key":"9022_CR26","unstructured":"Mittelmann test problems. ftp:\/\/plato.asu.edu\/pub\/lpfree.html\/"},{"key":"9022_CR27","unstructured":"NetLib test problems. http:\/\/www.netlib.org\/lp\/data\/"},{"key":"9022_CR28","volume-title":"Linear Optimization and Extensions","author":"M.W. Padberg","year":"1995","unstructured":"Padberg, M.W.: Linear Optimization and Extensions. Springer, Berlin (1995)"},{"key":"9022_CR29","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/BF01721801","volume":"12","author":"P.Q. Pan","year":"1990","unstructured":"Pan, P.Q.: Practical finite pivoting rules for the simplex method. OR Spektrum 12, 219\u2013225 (1990)","journal-title":"OR Spektrum"},{"issue":"1","key":"9022_CR30","first-page":"167","volume":"101","author":"P.Q. Pan","year":"1997","unstructured":"Pan, P.Q.: The most-obtuse-angle row pivot rule for achieving dual feasibility: a computational study. Eur. J. Oper. Res. 101(1), 167\u2013176 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"9022_CR31","unstructured":"Sequential object-oriented simplex. http:\/\/www.zib.de\/Optimization\/Software\/Soplex\/"},{"key":"9022_CR32","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/0377-2217(94)90312-3","volume":"72","author":"U.H. Suhl","year":"1994","unstructured":"Suhl, U.H.: MOPS\u2014Mathematical optimization system. Eur. J. Oper. Res. 72, 312\u2013322 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"9022_CR33","unstructured":"Suhl, U.H.: MOPS home page. World Wide Web, http:\/\/www.mops-optimizer.com\/ (1999)"},{"key":"9022_CR34","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1287\/ijoc.2.4.325","volume":"2","author":"U.H. Suhl","year":"1990","unstructured":"Suhl, U.H., Suhl, L.M.: Computing sparse LU factorizations for large-scale linear programming bases. ORSA J. Comput. 2, 325\u2013335 (1990)","journal-title":"ORSA J. Comput."},{"key":"9022_CR35","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02025534","volume":"43","author":"L.M. Suhl","year":"1993","unstructured":"Suhl, L.M., Suhl, U.H.: A fast LU-update for linear programming. Ann. Oper. Res. 43, 33\u201347 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"9022_CR36","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1137\/1007004","volume":"7","author":"P. Wolfe","year":"1965","unstructured":"Wolfe, P.: The composite simplex algorithm. SIAM Rev. 7(1), 42\u201354 (1965)","journal-title":"SIAM Rev."},{"key":"9022_CR37","unstructured":"Wunderling, R.: Paralleler und objektorientierter simplex. Techniqual report TR-96-09, Konrad-Zuse-Zentrum f\u00fcr Informationstechnik, Berlin (1996)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9022-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9022-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9022-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:31Z","timestamp":1559302591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9022-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,14]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,3,29]]}},"alternative-id":["9022"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9022-3","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,14]]}}}