{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T14:47:09Z","timestamp":1747234029855},"reference-count":16,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,10,1]],"date-time":"1992-10-01T00:00:00Z","timestamp":717897600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1992,10]]},"DOI":"10.1016\/0167-6377(92)90048-8","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"227-233","source":"Crossref","is-referenced-by-count":8,"title":["Algorithms for the minimum cost circulation problem based on maximizing the mean improvement"],"prefix":"10.1016","volume":"12","author":[{"given":"Refael","family":"Hassin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(92)90048-8_bib1","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1137\/0218039","article-title":"Note on Weintraub's minimum cost circulation algorithm","volume":"18","author":"Barahona","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6377(92)90048-8_bib2","series-title":"Finite Graphs and Networks: An Introduction with Applications","author":"Busacker","year":"1965"},{"key":"10.1016\/0167-6377(92)90048-8_bib3","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1016\/0167-6377(91)90027-M","article-title":"A dual algorithm for submodular flow problems","volume":"10","author":"Chung","year":"1991","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(92)90048-8_bib4","series-title":"International Symposium Rome","first-page":"77","article-title":"Finding a cycle in a graph with minimum cost to time ratio with applications to a ship routing problem","author":"Danzig","year":"1967"},{"key":"10.1016\/0167-6377(92)90048-8_bib5","doi-asserted-by":"crossref","first-page":"389","DOI":"10.21136\/CMJ.1975.101334","article-title":"Diagonal similarity and equivalence for matrices over groups with 0","volume":"25","author":"Engel","year":"1975","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/0167-6377(92)90048-8_bib6","article-title":"A strongly polynomial maximum mean cut cancelling algorithm for minimum cost network flow","author":"Ervolina","year":"1990","journal-title":"UBC Faculty of Commerce Working Paper 90-MSC-009"},{"key":"10.1016\/0167-6377(92)90048-8_bib7","article-title":"Cancelling most helpful cuts for minimum cost network flow","author":"Ervolina","year":"1990","journal-title":"UBC Faculty of Commerce Working Paper 90MSC-018"},{"key":"10.1016\/0167-6377(92)90048-8_bib8","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/76359.76368","article-title":"Finding minimum-cost circulations by cancelling negative cycles","volume":"36","author":"Goldberg","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0167-6377(92)90048-8_bib9","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/BF02591772","article-title":"The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm","volume":"25","author":"Hassin","year":"1983","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(92)90048-8_bib10","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1287\/mnsc.14.3.205","article-title":"A primal method for minimal cost flows","volume":"14","author":"Klein","year":"1967","journal-title":"Management Sci."},{"key":"10.1016\/0167-6377(92)90048-8_bib11","unstructured":"S.T. McCormick (1991), Private communication."},{"key":"10.1016\/0167-6377(92)90048-8_bib12","article-title":"Computing maximum mean cuts","author":"McCormick","year":"1990","journal-title":"UBC Faculty of Commerce Working Paper 90-MSC-011"},{"key":"10.1016\/0167-6377(92)90048-8_bib13","series-title":"Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms","article-title":"Minizing capacity violations in a transhipment network","author":"Radzik","year":"1992"},{"key":"10.1016\/0167-6377(92)90048-8_bib14","series-title":"presented at the 14th International Symposium on Mathematical Programming","article-title":"An improved time bound for computing maximum mean cuts","author":"Rote","year":"1991"},{"key":"10.1016\/0167-6377(92)90048-8_bib15","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1287\/mnsc.21.1.87","article-title":"A primal algorithm to solve network flow problems with convex costs","volume":"21","author":"Weintraub","year":"1974","journal-title":"Management Sci."},{"key":"10.1016\/0167-6377(92)90048-8_bib16","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01580132","article-title":"A bad network problem for the simplex method and other minimum cost flow algorithms","volume":"5","author":"Zadeh","year":"1973","journal-title":"Math. Programming"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637792900488?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637792900488?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T13:14:54Z","timestamp":1623158094000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637792900488"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,10]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,10]]}},"alternative-id":["0167637792900488"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(92)90048-8","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1992,10]]}}}