{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:04Z","timestamp":1752378004640,"version":"3.41.2"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1023\/a:1025102305440","type":"journal-article","created":{"date-parts":[[2003,9,16]],"date-time":"2003-09-16T18:25:03Z","timestamp":1063736703000},"page":"63-81","source":"Crossref","is-referenced-by-count":5,"title":["A Piecewise Linear Dual Phase-1 Algorithm for the Simplex Method"],"prefix":"10.1007","volume":"26","author":[{"given":"Istv\u00e1n","family":"Maros","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5141768_CR1","unstructured":"V. Chv\u00e1tal, Linear Programming, Freeman and Co., 1983."},{"key":"5141768_CR2","volume-title":"Linear Programming and Extensions","author":"G.B. Dantzig","year":"1963","unstructured":"G.B. Dantzig, Linear Programming and Extensions, Princeton University Press: Princeton, N.J., 1963."},{"issue":"3","key":"5141768_CR3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01581089","volume":"57","author":"J.J. Forrest","year":"1992","unstructured":"J.J. Forrest and D. Goldfarb, \u201cSteepest edge simplex algorithms for linear programming,\u201d Mathematical Programming, vol. 57, no. 3, pp. 341-374, 1992.","journal-title":"Mathematical Programming"},{"key":"5141768_CR4","unstructured":"R. Fourer, \u201cNotes on the dual simplex method,\u201d Unpublished, March, 1994."},{"key":"5141768_CR5","first-page":"10","volume":"13","author":"D.M. Gay","year":"1985","unstructured":"D.M. Gay, \u201cElectronic mail distribution of linear programming test problems,\u201d COAL Newsletter,Mathematical Programming Society, vol. 13, pp. 10-12, 1985.","journal-title":"COAL Newsletter,Mathematical Programming Society"},{"key":"5141768_CR6","doi-asserted-by":"crossref","unstructured":"H.J. Greenberg, \u201cPivot selection tactics,\u201d in Design and Implementation of Optimization Software. H.J. Greenberg (Ed.), Sijthoff and Nordhoff, 1978, pp. 109-143.","DOI":"10.1007\/978-94-009-9935-0_6"},{"key":"5141768_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01580108","volume":"5","author":"P.M.J. Harris","year":"1973","unstructured":"P.M.J. Harris, \u201cPivot selection method of the devex LP code,\u201d Mathematical Programming, vol. 5, pp. 1-28, 1973.","journal-title":"Mathematical Programming"},{"key":"5141768_CR8","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1002\/nav.3800010107","volume":"1","author":"C.E. Lemke","year":"1954","unstructured":"C.E. Lemke, \u201cThe dual method of solving the linear programming problem,\u201d Naval Research Logistics Quarterly, vol. 1, pp. 36-47, 1954.","journal-title":"Naval Research Logistics Quarterly"},{"key":"5141768_CR9","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1016\/0377-2217(86)90215-8","volume":"23","author":"I. Maros","year":"1986","unstructured":"I. Maros, \u201cA general phase-I method in linear programming,\u201d European Journal of Operational Research, vol. 23, pp. 64-77, 1986.","journal-title":"European Journal of Operational Research"},{"key":"5141768_CR10","doi-asserted-by":"crossref","unstructured":"I. Maros, \u201cA piecewise linear dual procedure in mixed integer programming,\u201d in New Trends in Mathematical Programming. F. Giannesi, R. Schaible and S. Komlosi (Eds.), Kluwer Academic Publishers, 1998, pp. 159-170.","DOI":"10.1007\/978-1-4757-2878-1_12"},{"key":"5141768_CR11","doi-asserted-by":"crossref","unstructured":"I. Maros and G. Mitra, \u201cSimplex algorithms,\u201d ch. 1, in Advances in Linear and Integer Programming. J. Beasley (Ed.), Oxford University Press, 1996, pp. 1-46.","DOI":"10.1093\/oso\/9780198538561.003.0001"},{"key":"5141768_CR12","unstructured":"W. Orchard-Hays, Advanced Linear-Programming Computing Techniques, McGraw-Hill, 1968."},{"key":"5141768_CR13","unstructured":"M. Padberg, Linear Optimization and Extensions, Springer, 1995."},{"key":"5141768_CR14","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1137\/0111016","volume":"11","author":"P. Wolfe","year":"1963","unstructured":"Ph. Wolfe, \u201cA technique for resolving degeneracy in linear programming,\u201d SIAM Journal of Applied Mathematics, vol. 11, pp. 205-211, 1963.","journal-title":"SIAM Journal of Applied Mathematics"},{"issue":"1","key":"5141768_CR15","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1137\/1007004","volume":"7","author":"P. Wolfe","year":"1965","unstructured":"Ph. Wolfe, \u201cThe composite simplex algorithm,\u201d SIAM Review, vol. 7, no. 1, pp. 42-54, 1965.","journal-title":"SIAM Review"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025102305440.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1025102305440\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1025102305440.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:19:17Z","timestamp":1752376757000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1025102305440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["5141768"],"URL":"https:\/\/doi.org\/10.1023\/a:1025102305440","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}