{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T08:53:07Z","timestamp":1648803187634},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,8,6]],"date-time":"2018-08-06T00:00:00Z","timestamp":1533513600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10878-018-0331-5","type":"journal-article","created":{"date-parts":[[2018,8,6]],"date-time":"2018-08-06T11:53:18Z","timestamp":1533556398000},"page":"957-969","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An $$O(n(m+n\\log n)\\log n)$$O(n(m+nlogn)logn) time algorithm to solve the minimum cost tension problem"],"prefix":"10.1007","volume":"37","author":[{"given":"Mehdi","family":"Ghiyasvand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,6]]},"reference":[{"key":"331_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs"},{"key":"331_CR2","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1287\/mnsc.49.7.950.16384","volume":"49","author":"RK Ahuja","year":"2003","unstructured":"Ahuja RK, Hochbaum DS, Orlin JB (2003) Solving the convex cost integer dual network flow problem. Manage Sci 49:950\u2013964","journal-title":"Manage Sci"},{"key":"331_CR3","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1016\/j.ejor.2008.07.033","volume":"197","author":"B Bachelet","year":"2009","unstructured":"Bachelet B, Duhamel C (2009) Aggregation approach for the minimum binary cost tension problem. Eur J Oper Res 197:837\u2013841","journal-title":"Eur J Oper Res"},{"issue":"4","key":"331_CR4","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1051\/ro:2004202","volume":"37","author":"B Bachelet","year":"2003","unstructured":"Bachelet B, Mahey P (2003) Minimum convex-cost tension problems on series-parallel graphs. RAIRO Oper Res 37(4):221\u2013234","journal-title":"RAIRO Oper Res"},{"issue":"4","key":"331_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10288-004-0049-3","volume":"2","author":"B Bachelet","year":"2004","unstructured":"Bachelet B, Mahey P (2004) Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs. 4OR Q J Eur Oper Res Soc 2(4):275\u2013291","journal-title":"4OR Q J Eur Oper Res Soc"},{"key":"331_CR6","volume-title":"Programming, games and transportation networks","author":"C Berge","year":"1962","unstructured":"Berge C, Ghouila-Houri A (1962) Programming, games and transportation networks. Wiley, New York"},{"key":"331_CR7","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"I Edmonds","year":"1972","unstructured":"Edmonds I, Karp RM (1972) Theoretical improvements in algorithmic efficiency for network flow problems. J Assoc Comput Mach 19:248\u2013264","journal-title":"J Assoc Comput Mach"},{"key":"331_CR8","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman ML, Tarjan RE (1987) Fibonacci heaps and their uses in improved network optimization algorithms. J Assoc Comput Mach 34:596\u2013615","journal-title":"J Assoc Comput Mach"},{"key":"331_CR9","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/0022-0000(85)90039-X","volume":"31","author":"HN Gabow","year":"1985","unstructured":"Gabow HN (1985) Scaling algorithms for network problems. J Comput Syst Sci 31:148\u2013168","journal-title":"J Comput Syst Sci"},{"key":"331_CR10","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2012.03.042","volume":"448","author":"M Ghiyasvand","year":"2012","unstructured":"Ghiyasvand M (2012) An \n                              $$O(m(m+n\\log n)\\log (nC))$$\n                              \n                                 \n                                 \n                                    \n                                       O\n                                       (\n                                       m\n                                       (\n                                       m\n                                       +\n                                       n\n                                       log\n                                       n\n                                       )\n                                       log\n                                       (\n                                       n\n                                       C\n                                       )\n                                       )\n                                    \n                                 \n                              \n                              \n                           -time algorithm to solve the minimum cost tension problem. Theor Comput Sci 448:47\u201355","journal-title":"Theor Comput Sci"},{"issue":"2","key":"331_CR11","first-page":"104","volume":"1","author":"M Ghiyasvand","year":"2012","unstructured":"Ghiyasvand M (2012) A polynomial-time implementation of Pla\u2019s method to solve the MCT problem. Adv Comput Math Its Appl 1(2):104\u2013109","journal-title":"Adv Comput Math Its Appl"},{"key":"331_CR12","first-page":"980","volume":"21","author":"M Ghiyasvand","year":"2014","unstructured":"Ghiyasvand M (2014) Scaling implementation of a tension rectification algorithm to solve the feasible differential problem. Sci Iran 21:980\u2013987","journal-title":"Sci Iran"},{"key":"331_CR13","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10878-016-0070-4","volume":"34","author":"M Ghiyasvand","year":"2017","unstructured":"Ghiyasvand M (2017) A faster strongly polynomial time algorithm to solve the minimum cost tension problem. J Comb Optim 34:203\u2013217","journal-title":"J Comb Optim"},{"key":"331_CR14","doi-asserted-by":"crossref","unstructured":"Ghouila-Houri A (1964) Flots et tension dans un graphe, Ph.D Thesis, Gauthier-Villars, Paris","DOI":"10.24033\/asens.1132"},{"key":"331_CR15","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1287\/moor.15.3.430","volume":"16","author":"AV Goldberg","year":"1990","unstructured":"Goldberg AV, Tarjan RE (1990) Finding minimum-cost circulations by successive approximation. Math Oper Res 16:430\u2013466","journal-title":"Math Oper Res"},{"key":"331_CR16","unstructured":"Guler C (2008) Inverse tension problems and monotropic optimization. WIMA Report"},{"key":"331_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0304-3975(97)00186-2","volume":"194","author":"M Hadjiat","year":"1998","unstructured":"Hadjiat M (1998) Penelope\u2019s graph: a hard minimum cost tension instance. Theor Comput Sci 194:207\u2013218","journal-title":"Theor Comput Sci"},{"issue":"166","key":"331_CR18","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/S0012-365X(96)00185-9","volume":"165","author":"M Hadjiat","year":"1997","unstructured":"Hadjiat M, Maurras JF (1997) A strongly polynomial algorithm for the minimum cost tension problem. Discrete Math 165(166):377\u2013394","journal-title":"Discrete Math"},{"issue":"3","key":"331_CR19","first-page":"285","volume":"6","author":"HW Hamacher","year":"1985","unstructured":"Hamacher HW (1985) Min cost tension. J Inf Optim Sci 6(3):285\u2013304","journal-title":"J Inf Optim Sci"},{"key":"331_CR20","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/S0097539794263695","volume":"26","author":"A Karzanov","year":"1997","unstructured":"Karzanov A, McCormick ST (1997) Polynomial methods for separable convex optimization in unimodular linear spaces with applications. SIAM J Comput 26:1245\u20131275","journal-title":"SIAM J Comput"},{"key":"331_CR21","unstructured":"Maurras JF (1994) The maximum cost tension problem. In: Proceedings Conference, European chapter on combinatorial optimization (ECCO VII), Italy"},{"key":"331_CR22","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1287\/opre.41.2.338","volume":"41","author":"JB Orlin","year":"1993","unstructured":"Orlin JB (1993) A faster strongly polynomial minimum cost flow algorithm. Oper Res 41:338\u2013350","journal-title":"Oper Res"},{"key":"331_CR23","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF01584092","volume":"1","author":"JM Pla","year":"1971","unstructured":"Pla JM (1971) An out-of-kilter algorithm for solving minimum cost potential problems. Math Program 1:275\u2013290","journal-title":"Math Program"},{"key":"331_CR24","volume-title":"Network flows and monotropic optimization","author":"RT Rockafeller","year":"1984","unstructured":"Rockafeller RT (1984) Network flows and monotropic optimization. Wiley, New York"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0331-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0331-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0331-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,5]],"date-time":"2019-08-05T23:13:15Z","timestamp":1565046795000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0331-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,6]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["331"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0331-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,6]]},"assertion":[{"value":"6 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}