{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T18:02:07Z","timestamp":1648749727603},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,4,12]],"date-time":"2009-04-12T00:00:00Z","timestamp":1239494400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1007\/s10287-009-0094-7","type":"journal-article","created":{"date-parts":[[2009,4,11]],"date-time":"2009-04-11T03:43:16Z","timestamp":1239421396000},"page":"207-223","source":"Crossref","is-referenced-by-count":0,"title":["Computational study of the GDPO dual phase-1 algorithm"],"prefix":"10.1007","volume":"7","author":[{"given":"Istv\u00e1n","family":"Maros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,4,12]]},"reference":[{"issue":"1","key":"94_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10287-004-0020-y","volume":"2","author":"JF Benders","year":"2005","unstructured":"Benders JF (2005) Partitioning procedures for solving mixed-variables programming problems. Comput Manage Sci 2(1): 3\u201319","journal-title":"Comput Manage Sci"},{"key":"94_CR2","volume-title":"Linear programming and extensions","author":"GB Dantzig","year":"1963","unstructured":"Dantzig GB (1963) Linear programming and extensions. Princeton University Press, Princeton"},{"issue":"3","key":"94_CR3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01581089","volume":"57","author":"JJH Forrest","year":"1992","unstructured":"Forrest JJH, Goldfarb D (1992) Steepest edge simplex algorithms for linear programming. Math Program 57(3): 341\u2013374","journal-title":"Math Program"},{"key":"94_CR4","unstructured":"Fourer R (1994) Notes on the dual simplex method. Draft, Department of Industrial Engineering and Management Sciences, Northwestern University, March 1994. Optimization online, August 2000. http:\/\/www.optimization-online.org\/DB_HTML\/2000\/08\/214.html"},{"key":"94_CR5","doi-asserted-by":"crossref","unstructured":"Hall JAJ (2008) Towards a practical parallelisation of the simplex method. Comput Manage Sci. doi: 10.1007\/s10287-008-0080-5","DOI":"10.1007\/s10287-008-0080-5"},{"key":"94_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580108","volume":"5","author":"PMJ Harris","year":"1973","unstructured":"Harris PMJ (1973) Pivot selection method of the Devex LP code. Math Program 5: 1\u201328","journal-title":"Math Program"},{"issue":"1","key":"94_CR7","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 (2007) Progress in the dual simplex method for large scale LP problems: practical dual phase 1 algorithms. Comput Optim Appl 37(1): 49\u201365","journal-title":"Comput Optim Appl"},{"key":"94_CR8","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1002\/nav.3800010107","volume":"1","author":"CE Lemke","year":"1954","unstructured":"Lemke CE (1954) The dual method of solving the linear programming problem. Naval Res Logist Q 1: 36\u201347","journal-title":"Naval Res Logist Q"},{"key":"94_CR9","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 (1998) A Piecewise linear dual procedure in mixed integer programming. In: Giannesi F, Koml\u00f3si S, Rapcs\u00e1k T (eds) New trends in mathematical programming. Kluwer, Dordrecht, pp 159\u2013170"},{"key":"94_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1025102305440","volume":"26","author":"I Maros","year":"2003","unstructured":"Maros I (2003a) A piecewise linear dual phase-1 algorithm for the simplex method. Comput Optim Appl 26: 63\u201381","journal-title":"Comput Optim Appl"},{"key":"94_CR11","doi-asserted-by":"crossref","unstructured":"Maros I (2003b) Computational techniques of the simplex method. In: International series in operations research and management. Kluwer, Boston, vol 61. ISBN 1\u20134020\u20137332\u20131. 325+xx p (research monograph)","DOI":"10.1007\/978-1-4615-0257-9"},{"key":"94_CR12","first-page":"1","volume-title":"Advances in linear and integer programming","author":"I Maros","year":"1996","unstructured":"Maros I, Mitra G (1996) Simplex algorithms. In: Beasley J (eds) Advances in linear and integer programming. Oxford University Press, New York, pp 1\u201346"},{"issue":"2","key":"94_CR13","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1287\/ijoc.10.2.248","volume":"10","author":"I Maros","year":"1998","unstructured":"Maros I, Mitra G (1998) Strategies for creating advanced bases for large-scale linear programming problems. Informs J Comput 10(2): 248\u2013260","journal-title":"Informs J Comput"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-009-0094-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-009-0094-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-009-0094-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:48Z","timestamp":1559131968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-009-0094-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4,12]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["94"],"URL":"https:\/\/doi.org\/10.1007\/s10287-009-0094-7","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,4,12]]}}}