{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T17:30:18Z","timestamp":1680456618243},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T00:00:00Z","timestamp":1408752000000},"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":["Comput Optim Appl"],"published-print":{"date-parts":[[2015,4]]},"DOI":"10.1007\/s10589-014-9689-1","type":"journal-article","created":{"date-parts":[[2014,8,22]],"date-time":"2014-08-22T09:11:56Z","timestamp":1408698716000},"page":"587-608","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Novel update techniques for the revised simplex method"],"prefix":"10.1007","volume":"60","author":[{"given":"Qi","family":"Huangfu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. A. Julian","family":"Hall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,23]]},"reference":[{"key":"9689_CR1","doi-asserted-by":"crossref","unstructured":"Hall, J.A.J., Huangfu, Q.: A high performance dual revised simplex solver. In: R. Wyrzykowski et al. (ed.) PPAM 2011, Part I. LNCS, vol. 7203, pp. 143\u2013151. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-31464-3_15"},{"issue":"3","key":"9689_CR2","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1007\/s10589-013-9542-y","volume":"55","author":"M Lubin","year":"2013","unstructured":"Lubin, M., Hall, J.A.J., Petra, C.G., Anitescu, M.: Parallel distributed-memory simplex for large-scale stochastic LP problems. Comput. Optim. Appl. 55(3), 571\u2013596 (2013)","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"9689_CR3","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1287\/ijoc.2.4.325","volume":"2","author":"UH Suhl","year":"1990","unstructured":"Suhl, U.H., Suhl, L.M.: Computing sparse LU factorizations for large-scale linear programming bases. ORSA J. Comput. 2(4), 325\u2013335 (1990)","journal-title":"ORSA J. Comput."},{"key":"9689_CR4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1093\/imamat\/10.3.289","volume":"10","author":"JA Tomlin","year":"1972","unstructured":"Tomlin, J.A.: Pivoting for size and sparsity in linear programming inversion routines. J. Inst. Math. Appl. 10, 289\u2013295 (1972)","journal-title":"J. Inst. Math. Appl."},{"key":"9689_CR5","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1090\/S0025-5718-1954-0061469-8","volume":"8","author":"GB Dantzig","year":"1954","unstructured":"Dantzig, G.B., Orchard-Hays, W.: The product form for the inverse in the simplex method. Math. Comp. 8, 64\u201367 (1954)","journal-title":"Math. Comp."},{"key":"9689_CR6","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1007\/BF02169151","volume":"16","author":"RH Bartels","year":"1971","unstructured":"Bartels, R.H.: A stabilization of the simplex method. Numer. Math. 16, 414\u2013434 (1971)","journal-title":"Numer. Math."},{"key":"9689_CR7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF01584548","volume":"2","author":"JJH Forrest","year":"1972","unstructured":"Forrest, J.J.H., Tomlin, J.A.: Updated triangular factors of the basis to maintain sparsity in the product form simplex method. Math. Program. 2, 263\u2013278 (1972)","journal-title":"Math. Program."},{"issue":"1","key":"9689_CR8","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01585094","volume":"24","author":"JK Reid","year":"1982","unstructured":"Reid, J.K.: A sparsity-exploiting variant of the Bartels-Golub decomposition for linear programming bases. Math. Program. 24(1), 55\u201369 (1982)","journal-title":"Math. Program."},{"issue":"1","key":"9689_CR9","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/BF02025534","volume":"43","author":"UH Suhl","year":"1993","unstructured":"Suhl, U.H., Suhl, L.M.: A fast LU update for linear programming. Ann. Oper. Res. 43(1), 33\u201347 (1993)","journal-title":"Ann. Oper. Res."},{"key":"9689_CR10","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1137\/0613016","volume":"13","author":"SK Eldersveld","year":"1992","unstructured":"Eldersveld, S.K., Saunders, M.A.: A block-LU update for large-scale linear programming. SIAM J. Matrix Anal. Appl. 13, 191\u2013201 (1992)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9689_CR11","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1137\/0905041","volume":"5","author":"PE Gill","year":"1984","unstructured":"Gill, P.E., Murray, W., Saunders, M.A., Wright, M.H.: Sparse matrix methods in optimization. SIAM J. Sci. Stat. Comput. 5, 562\u2013589 (1984)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"9689_CR12","unstructured":"Hall, J.A.J.: Sparse matrix algebra for active set methods in linear programming. Ph.D. thesis, University of Dundee Department of Mathematics and Computer Science (1991)"},{"key":"9689_CR13","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BF01584341","volume":"13","author":"J Bisschop","year":"1977","unstructured":"Bisschop, J., Meeraus, A.J.: Matrix augmentation and partitioning in the updating of the basis inverse. Math. Program. 13, 241\u2013254 (1977)","journal-title":"Math. Program."},{"issue":"4","key":"9689_CR14","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1504\/IJMOR.2012.048901","volume":"4","author":"JM Elble","year":"2012","unstructured":"Elble, J.M., Sahinidis, N.V.: A review of the LU update in the simplex algorithm. Int. J. Math. Oper. Res. 4(4), 366\u2013399 (2012)","journal-title":"Int. J. Math. Oper. Res."},{"key":"9689_CR15","unstructured":"Huangfu, Q., Hall, J.A.J.: Parallel dual simplex methods. School of Mathematics, University of Edinburgh, Technical Report (2014). (In preparation)"},{"issue":"3","key":"9689_CR16","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10589-005-4802-0","volume":"32","author":"JAJ Hall","year":"2005","unstructured":"Hall, J.A.J., McKinnon, K.I.M.: Hyper-sparsity in the revised simplex method and how to exploit it. Comput. Optim. Appl. 32(3), 259\u2013283 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"9689_CR17","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1007\/BF01580221","volume":"6","author":"JA Tomlin","year":"1974","unstructured":"Tomlin, J.A.: On pricing and backward transformation in linear programming. Math. Program. 6, 42\u201347 (1974)","journal-title":"Math. Program."},{"key":"9689_CR18","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/BFb0120714","volume":"4","author":"RR Rosander","year":"1975","unstructured":"Rosander, R.R.: Multiple pricing and suboptimization in dual linear programming algorithms. Math. Program. Study 4, 108\u2013117 (1975)","journal-title":"Math. Program. Study"},{"issue":"5","key":"9689_CR19","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/362946.362974","volume":"12","author":"RH Bartels","year":"1969","unstructured":"Bartels, R.H., Golub, G.H.: The simplex method of linear programming using LU decomposition. Commun. ACM 12(5), 266\u2013268 (1969)","journal-title":"Commun. ACM"},{"key":"9689_CR20","unstructured":"COIN-OR: Clp. http:\/\/www.coin-r.org\/projects\/Clp.xml . Accessed 26 June 2013"},{"issue":"2","key":"9689_CR21","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(2), 185\u2013204 (2008)","journal-title":"Comput. Optim. Appl."},{"issue":"5","key":"9689_CR22","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1137\/0909058","volume":"9","author":"JR Gilbert","year":"1988","unstructured":"Gilbert, J.R., Peierls, T.: Sparse partial pivoting in time proportional to arithmetic operations. SIAM J. Sci. Stat. Comput. 9(5), 862\u2013874 (1988)","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"9689_CR23","first-page":"10","volume":"13","author":"DM Gay","year":"1985","unstructured":"Gay, D.M.: Electronic mail distribution of linear programming test problems. Math. Program. Soc. COAL Newslett. 13, 10\u201312 (1985)","journal-title":"Math. Program. Soc. COAL Newslett."},{"issue":"2","key":"9689_CR24","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1287\/opre.38.2.240","volume":"38","author":"WJ Carolan","year":"1990","unstructured":"Carolan, W.J., Hill, J.E., Kennington, J.L., Niemi, S., Wichmann, S.J.: An empirical evaluation of the KORBX algorithms for military airlift applications. Oper. Res. 38(2), 240\u2013248 (1990)","journal-title":"Oper. Res."},{"key":"9689_CR25","unstructured":"IBM: ILOG CPLEX Optimizer. http:\/\/www.ibm.com\/software\/products\/gb\/en\/ibmilogcpleoptistud\/ . Accessed 26 June 2013"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9689-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-014-9689-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-014-9689-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T01:59:32Z","timestamp":1565747972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-014-9689-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,23]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,4]]}},"alternative-id":["9689"],"URL":"https:\/\/doi.org\/10.1007\/s10589-014-9689-1","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,23]]}}}