{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:28:05Z","timestamp":1752460085133},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1007\/bf02023108","type":"journal-article","created":{"date-parts":[[2005,8,12]],"date-time":"2005-08-12T10:28:34Z","timestamp":1123842514000},"page":"431-442","source":"Crossref","is-referenced-by-count":2,"title":["A practical anti-degeneracy row selection technique in network linear programming"],"prefix":"10.1007","volume":"46-47","author":[{"given":"Istv\u00e1n","family":"Maros","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF02023108_CR1","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1287\/moor.4.2.196","volume":"4","author":"W.H. Cunningham","year":"1979","unstructured":"W.H. Cunningham, Theoretical properties of the network simplex method, Math. Oper. Res. 4(1979)196\u2013208.","journal-title":"Math. Oper. Res."},{"key":"BF02023108_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, NJ. 1963)."},{"key":"BF02023108_CR3","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF01589114","volume":"45","author":"P.E. Gill","year":"1989","unstructured":"P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, A practical anti-cycling procedure for linearly constrained optimization, Math. Progr. 45(1989)437\u2013474.","journal-title":"Math. Progr."},{"key":"BF02023108_CR4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/net.3230200108","volume":"20","author":"D. Goldfarb","year":"1990","unstructured":"D. Goldfarb, J. Hao and S.-R. Kai, Anti-stalling pivot rules for the network simplex algorithm, Networks 20(1990)79\u201391.","journal-title":"Networks"},{"key":"BF02023108_CR5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BFb0121089","volume":"26","author":"M.D. Grigoriadis","year":"1986","unstructured":"M.D. Grigoriadis, An efficient implementation of the network simplex method, Math. Progr. Study 26(1986)83\u2013111.","journal-title":"Math. Progr. Study"},{"key":"BF02023108_CR6","first-page":"30","volume":"5","author":"P.M.J. Harris","year":"1973","unstructured":"P.M.J. Harris, Pivot selection methods of the Devex LP code, Math. Progr. 5(1973)30\u201357.","journal-title":"Math. Progr."},{"key":"BF02023108_CR7","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/BFb0120940","volume":"15","author":"R.R. Love","year":"1981","unstructured":"R.R. Love, Traffic scheduling via Benders decomposition, Math. Progr. Study 15(1981)102\u2013124.","journal-title":"Math. Progr. Study"},{"key":"BF02023108_CR8","unstructured":"I. Maros, MINET, a fast network LP solver, IIASA Working Paper WP-87-50, IIASA A-2361 Laxenburg, Austria (June 1987)."},{"key":"BF02023108_CR9","unstructured":"I. Maros, MINET, fast network LP solver. Description and user's guide for V2.00, IIASA Working Paper WP-88-6, IIASA, A-2361 Laxenburg, Austria (January 1988)."},{"key":"BF02023108_CR10","volume-title":"MILP, linear programming optimizer for personal computers under DOS","author":"I. Maros","year":"1990","unstructured":"I. Maros, MILP, linear programming optimizer for personal computers under DOS, Preprints in Optimization, Abteilung f\u00fcr Mathematische Optimierung, Technische Universit\u00e4t zu Braunschweig, Braunschweig, Germany (September 1990)."},{"key":"BF02023108_CR11","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/322063.322070","volume":"25","author":"J.M. Mulvey","year":"1978","unstructured":"J.M. Mulvey, Pivot strategies for primal-simplex network codes, J. ACM 25(1978)266\u2013270.","journal-title":"J. ACM"},{"key":"BF02023108_CR12","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1137\/0111016","volume":"11","author":"P. Wolfe","year":"1963","unstructured":"P. Wolfe, A technique for resolving degeneracy in linear programming, SIAM J. Appl. Math. 11(1963)205\u2013211.","journal-title":"SIAM J. Appl. Math."},{"key":"BF02023108_CR13","volume-title":"The first DIMACS international algorithm implementation challenge, DIMACS","author":"C. McGeogh","year":"1991","unstructured":"C. McGeogh, The first DIMACS international algorithm implementation challenge, DIMACS, Rutgers University, NJ, USA (October, 1991)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023108.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02023108\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02023108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T22:39:58Z","timestamp":1557787198000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02023108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["BF02023108"],"URL":"https:\/\/doi.org\/10.1007\/bf02023108","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}