{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,4]],"date-time":"2024-07-04T00:55:02Z","timestamp":1720054502685},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5982,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0012-365x(96)00185-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:55:55Z","timestamp":1027594555000},"page":"377-394","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["A strongly polynomial algorithm for the minimum cost tension problem"],"prefix":"10.1016","volume":"165-166","author":[{"given":"Malika","family":"Hadjiat","sequence":"first","affiliation":[]},{"given":"Jean Fran\u00e7ois","family":"Maurras","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00185-9_BIB1","series-title":"Programming, Games and Transportation Networks","author":"Berge","year":"1962"},{"key":"10.1016\/S0012-365X(96)00185-9_BIB2","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.3230150206","article-title":"Minimum cuts, modular functions and matroid polyhedra","volume":"15","author":"Cunningham","year":"1985","journal-title":"Networks"},{"key":"10.1016\/S0012-365X(96)00185-9_BIB3","article-title":"Flots et tensions dans un graphe","author":"Ghouila-Houri","year":"1964","journal-title":"Th\u00e8se"},{"key":"10.1016\/S0012-365X(96)00185-9_BIB4","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1145\/76359.76368","article-title":"Finding minimum cost circulations by canceling negative cycles","volume":"33","author":"Goldberg","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/S0012-365X(96)00185-9_BIB5","series-title":"Actes des Troisi\u00e8mes Journ\u00e9es du groupe MODE","article-title":"Dualit\u00e9 entre flot et tension","author":"Hadjiat","year":"1995"},{"key":"10.1016\/S0012-365X(96)00185-9_BIB6","series-title":"Proc. ECCO VIII Conf. of the European Chapter on Combinatorial Optimization","first-page":"45","article-title":"Compatible cuts of minimum cost and minimum mean cost","author":"Hadjiat","year":"1995"},{"key":"10.1016\/S0012-365X(96)00185-9_BIB7","first-page":"285","article-title":"Min cost tensions","volume":"6","author":"Hamacher","year":"1985","journal-title":"J. Inform. Optim. Sci."},{"key":"10.1016\/S0012-365X(96)00185-9_BIB8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0012-365X(78)90011-0","article-title":"A characterization of the minimum cycle mean in a digraph","volume":"23","author":"Karp","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00185-9_BIB9","series-title":"Methods for Solving Operator Equations","first-page":"72","article-title":"On minimal mean cuts and circuits in a digraph","author":"Karzanov","year":"1985"},{"key":"10.1016\/S0012-365X(96)00185-9_BIB10","series-title":"Proc. 6th SODA","first-page":"78","article-title":"Polynomial methods for separable convex optimization in unimodular linear spaces with applications to circulations and co-circulations in networks","author":"Karzanov","year":"1995"},{"key":"10.1016\/S0012-365X(96)00185-9_BIB11","series-title":"Proc. 3rd ACM-SIAM Symp. on Discrete Algorithms","first-page":"157","article-title":"A faster deterministic max-flow algorithm","author":"King","year":"1992"},{"key":"10.1016\/S0012-365X(96)00185-9_BIB12","series-title":"Proc. Conf. of the European Chapter on Combinatorial Optimization (ECCO VII)","article-title":"The maximum cost tension problem","author":"Maurras","year":"1994"},{"key":"10.1016\/S0012-365X(96)00185-9_BIB13","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF01584092","article-title":"An out-of-kilter algorithm for solving minimum cost potential problems","volume":"1","author":"Pla","year":"1971","journal-title":"Math. Programming"},{"key":"10.1016\/S0012-365X(96)00185-9_BIB14","series-title":"Proc. 33rd IEEE Ann. Symp. of Foundations of Computer Science","first-page":"659","article-title":"Newton's method for fractional combinatorial optimization","author":"Radzik","year":"1992"},{"key":"10.1016\/S0012-365X(96)00185-9_BIB15","series-title":"Network flows and monotropic optimization","author":"Rockafellar","year":"1984"},{"key":"10.1016\/S0012-365X(96)00185-9_BIB16","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","article-title":"A strongly polynomial minimum cost circulation algorithm","volume":"53","author":"Tardos","year":"1985","journal-title":"Combinatorica"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96001859?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X96001859?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T16:25:41Z","timestamp":1556382341000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X96001859"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":16,"alternative-id":["S0012365X96001859"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00185-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}