{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T09:53:38Z","timestamp":1781776418758,"version":"3.54.5"},"reference-count":19,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004406","name":"University Transilvania, Brasov","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004406","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3045288","type":"journal-article","created":{"date-parts":[[2020,12,17]],"date-time":"2020-12-17T02:36:17Z","timestamp":1608172577000},"page":"225957-225966","source":"Crossref","is-referenced-by-count":2,"title":["Inverse Maximum Capacity Path Problems Under Sum-Type and Max-Type Distances and Their Practical Application to Transportation Networks"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1070-1383","authenticated-orcid":false,"given":"Adrian M.","family":"Deaconu","sequence":"first","affiliation":[{"name":"Department of Mathematics and Computer Science, University Transilvania, Braşov, Romania"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7559-3870","authenticated-orcid":false,"given":"Javad","family":"Tayyebi","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, Birjand University of Technology, Birjand, Iran"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1023\/B:JOCO.0000038914.26975.9b"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-017-1165-2"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-017-0546-5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-014-0140-z"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01539860"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-006-9016-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/11775096_21"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.37193\/CJM.2012.01.14","article-title":"The inverse maximum flow problem under Lk norms","volume":"28","author":"deaconu","year":"2012","journal-title":"Carpathian J Math"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.08.010"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488705"},{"key":"ref4","first-page":"144","article-title":"An algorithm for identifying dominant-edge metabolic pathways","author":"ullah","year":"2009","journal-title":"Proc IEEE\/ACM Int Conf Comput -Aided Des"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.3.293"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(91)90073-5"},{"key":"ref5","first-page":"210","author":"ahuja","year":"1993","journal-title":"Network Flows Theory Algorithms and Applications"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.49.5.771.10607"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1002\/net.10048"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s00355-010-0475-4"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1992.268047"},{"key":"ref9","article-title":"An introduction to inverse combinatorial problems","author":"demange","year":"2010","journal-title":"Paradigms of Combinatorial Optimization"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09296205.pdf?arnumber=9296205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,5]],"date-time":"2022-12-05T23:34:13Z","timestamp":1670283253000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9296205\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3045288","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}