{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:08:41Z","timestamp":1760706521487},"reference-count":14,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1997,7,1]],"date-time":"1997-07-01T00:00:00Z","timestamp":867715200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[1997,7]]},"DOI":"10.1016\/s0305-0548(96)00086-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"601-609","source":"Crossref","is-referenced-by-count":2,"title":["Applying steepest-edge techniques to a network primal-dual algorithm"],"prefix":"10.1016","volume":"24","author":[{"given":"Norman D.","family":"Curet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(96)00086-X_BIB1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01581089","article-title":"Steepest-edge simplex algorithms for linear programming","volume":"57","author":"Forrest","year":"1992","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(96)00086-X_BIB2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0167-6377(93)90045-I","article-title":"A primal dual simplex method for linear programs","volume":"13","author":"Curet","year":"1993","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(96)00086-X_BIB3","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/BF02739233","article-title":"A complementary pivoting algorithm for linear network problems","volume":"5","author":"Schneider","year":"1986","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(96)00086-X_BIB4","first-page":"16","article-title":"Enhancements of spanning tree labeling procedures for network optimization","volume":"17","author":"Barr","year":"1979","journal-title":"INFOR"},{"key":"10.1016\/S0305-0548(96)00086-X_BIB5","series-title":"Algorithms for Network Programming","author":"Kennington","year":"1980"},{"key":"10.1016\/S0305-0548(96)00086-X_BIB6","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/opre.36.1.93","article-title":"Relaxation methods for minimum cost ordinary and generalized network flow problems","volume":"36","author":"Bertsekas","year":"1988","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00086-X_BIB7","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1016\/0305-0548(94)90035-3","article-title":"An incremental primal-dual method for generalized networks","volume":"21","author":"Curet","year":"1994","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(96)00086-X_BIB8","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1287\/mnsc.20.5.814","article-title":"NETGEN: a program for generating large scale capacitated assignment, transportation, and minimum cost network flow problems","volume":"20","author":"Klingman","year":"1974","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(96)00086-X_BIB9","series-title":"Network Flows: Theory, Algorithms and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S0305-0548(96)00086-X_BIB10","series-title":"ORSA\/TIMS Joint National Meeting at New Orleans","article-title":"Computational Analysis of Large-Scale Pure Networks","author":"Klingman","year":"1987"},{"key":"10.1016\/S0305-0548(96)00086-X_BIB11","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1287\/opre.42.1.65","article-title":"Parallel simplex for large pure network problems: computational testing and sources of speedup","volume":"42","author":"Barr","year":"1994","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(96)00086-X_BIB12","first-page":"110","article-title":"An empirical study of min cost flow algorithms","volume":"12","author":"Bland","year":"1993","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/S0305-0548(96)00086-X_BIB13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1090\/dimacs\/012\/07","article-title":"On implementing scaling push-relabel algorithms for the minimum-cost flow problem","volume":"12","author":"Goldberg","year":"1993","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/S0305-0548(96)00086-X_BIB14","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1090\/dimacs\/012\/12","article-title":"An efficient implementation of a network interior point method","volume":"12","author":"Resende","year":"1993","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505489600086X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505489600086X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T22:28:37Z","timestamp":1555972117000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030505489600086X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,7]]},"references-count":14,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1997,7]]}},"alternative-id":["S030505489600086X"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(96)00086-x","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,7]]}}}