{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:21:30Z","timestamp":1648858890517},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2010,9]]},"abstract":"<jats:p> Network flows are of growing interest in both applications and theory. Given a network flow with costs and arc capacities, the classical max flow-min cost problem is to send a given amount of flow from the source vertex to the sink vertex at least cost. Among the predominant issues in this field are problems that result when the flow is going through one arc to another arc in the same direction, such as the role of compressors in gas pipeline networks or the role of transformers in electricity wide networks. Hence, in order to minimize the cost of these elements in the network, we perform applications of line-digraphs in the form of an optimization algorithm. This paper proposes a new variant of the max flow-min cost problem. Our objective is to find the smoothest max flow over a given network. <\/jats:p>","DOI":"10.1142\/s1793830910000735","type":"journal-article","created":{"date-parts":[[2010,10,12]],"date-time":"2010-10-12T04:44:00Z","timestamp":1286858640000},"page":"389-393","source":"Crossref","is-referenced-by-count":0,"title":["MINIMUM FLOW VARIATION IN MAXIMUM FLOWS"],"prefix":"10.1142","volume":"02","author":[{"given":"M.","family":"MASOUMI","sequence":"first","affiliation":[{"name":"Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. M.","family":"MOBASSERI","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Science and Research Branch, Islamic Azad University, Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. R.","family":"REZAEI","sequence":"additional","affiliation":[{"name":"Department of Computer Sciences, Shahid Beheshti University, G.C., Tehran, Iran"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","volume-title":"Graphs","author":"Berge C.","year":"1985"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02854581"},{"key":"rf3","volume-title":"Digraphs: Theory, Algorithms and Applications","author":"Bang-Jensen J.","year":"2001"},{"key":"rf4","volume-title":"Selected Topics in Graph Theory","author":"Hemminger R. L.","year":"1978"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"rf6","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja R. K.","year":"1993"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-1514-0"},{"key":"rf8","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"Bellman R.","journal-title":"Quart. Appl. Math."},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830910000735","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T21:34:49Z","timestamp":1565127289000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830910000735"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9]]},"references-count":9,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2010,9]]}},"alternative-id":["10.1142\/S1793830910000735"],"URL":"https:\/\/doi.org\/10.1142\/s1793830910000735","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9]]}}}