{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T03:36:48Z","timestamp":1777520208856,"version":"3.51.4"},"reference-count":13,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1051\/ro:2008017","type":"journal-article","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T10:19:02Z","timestamp":1219141142000},"page":"401-414","source":"Crossref","is-referenced-by-count":13,"title":["The inverse maximum flow problem considering<i>l<\/i><sub>\u221e<\/sub>norm"],"prefix":"10.1051","volume":"42","author":[{"given":"Adrian","family":"Deaconu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2008,8,20]]},"reference":[{"key":"R1","unstructured":"R.K. Ahuja, T.L. Magnanti and J.B. Orlin,Network Flows. Theory, Algorithms and Applications, Prentice Hall, Englewood Cliffs, NJ (1993)."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"R.K. Ahuja and J.B. Orlin,Combinatorial Algorithms for Inverse Network Flow Problems, Networks (2002).","DOI":"10.1002\/net.10048"},{"key":"R3","unstructured":"R.K. Ahuja and J.B. Orlin,Inverse Optimization, Working Paper, Sloan School of Management, MIT, Cambridge, MA (1998)."},{"key":"R4","unstructured":"E. Ciurea and L. Ciupala, Sequential and Parallel Algorithms for Minimum Flows,J. Appl. Math. Comput.15(2004) 53\u201375."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"E. Ciurea and A. Deaconu, Inverse Minimum Flow Problem,J. Appl. Math. Comp., Korea23(2007) 193\u2013203.","DOI":"10.1007\/BF02831968"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"A. Deaconu, The Inverse Maximum Flow Problem with Lower and Upper Bounds for the Flow, to appear inYUJOR18(2008).","DOI":"10.2298\/YJOR0801013D"},{"key":"R7","unstructured":"A. Deaconu, A Cardinality Inverse Maximum Flow Problem,Scientific Annals of Computer ScienceXVI(2006) 51\u201362."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"C. Heuberger, Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results,J. Combin. Optim.8(2004) 329\u2013361.","DOI":"10.1023\/B:JOCO.0000038914.26975.9b"},{"key":"R9","unstructured":"L. Liu and J. Zhang, Inverse Maximum Flow Problems under Weighted Hamming Distance,J. Combin. Optim.12(2006) 395\u2013408."},{"key":"R10","unstructured":"P.T. Sokkalingam, R.K. Ahuja and J.B. Orlin, Solving Inverse Spanning Tree Problems through Network Flow Techniques,Oper. Res.47(1999) 291\u2013298."},{"key":"R11","doi-asserted-by":"crossref","unstructured":"C. Yang and X. Chen, An Inverse Maximum Capacity Path Problem with Lower Bound Constraints,Acta Math. Sci., Ser. B22(2002) 207\u2013212.","DOI":"10.1016\/S0252-9602(17)30473-3"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"C. Yang, J. Zhang and Z. Ma, Inverse Maximum Flow and Minimum Cut Problems,Optimization40(1997) 147\u2013170.","DOI":"10.1080\/02331939708844306"},{"key":"R13","unstructured":"J. Zhang and C. Cai, Inverse Problems of Minimum Cuts,ZOR-Math. Methods Oper. Res.47(1998) 51\u201358."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2008017\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T08:32:45Z","timestamp":1557736365000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro:2008017"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":13,"journal-issue":{"issue":"3"},"alternative-id":["ro0639"],"URL":"https:\/\/doi.org\/10.1051\/ro:2008017","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7]]}}}