{"id":"https://openalex.org/W2111846710","doi":"https://doi.org/10.1051/ro:2008017","title":"The inverse maximum flow problem consideringl\u221enorm","display_name":"The inverse maximum flow problem consideringl\u221enorm","publication_year":2008,"publication_date":"2008-07-01","ids":{"openalex":"https://openalex.org/W2111846710","doi":"https://doi.org/10.1051/ro:2008017","mag":"2111846710"},"language":"en","primary_location":{"id":"doi:10.1051/ro:2008017","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2008017","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748","https://openalex.org/P4310319982"],"host_organization_lineage_names":["EDP Sciences","Science Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5079625019","display_name":"Adrian Marius Deaconu","orcid":"https://orcid.org/0000-0002-1070-1383"},"institutions":[{"id":"https://openalex.org/I3123573182","display_name":"Transylvania University of Bra\u0219ov","ror":"https://ror.org/01cg9ws23","country_code":"RO","type":"education","lineage":["https://openalex.org/I3123573182"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Adrian Deaconu","raw_affiliation_strings":["University \u201cTransilvania\u201d of Brasov, Faculty of Mathematics and Informatics, Theoretical Computer Science Departement, str. Iuliu Maniu 50, Brasov, Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University \u201cTransilvania\u201d of Brasov, Faculty of Mathematics and Informatics, Theoretical Computer Science Departement, str. Iuliu Maniu 50, Brasov, Romania","institution_ids":["https://openalex.org/I3123573182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079625019"],"corresponding_institution_ids":["https://openalex.org/I3123573182"],"apc_list":{"value":0,"currency":"EUR","value_usd":0},"apc_paid":null,"fwci":1.9772,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.86939298,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"42","issue":"3","first_page":"401","last_page":"414"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.6638787984848022},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5617464184761047},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.5494517683982849},{"id":"https://openalex.org/keywords/inverse-problem","display_name":"Inverse problem","score":0.5227006673812866},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.41227641701698303},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4023595452308655},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.3576394021511078},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3246528208255768},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.11812898516654968},{"id":"https://openalex.org/keywords/political-science","display_name":"Political science","score":0.08686724305152893}],"concepts":[{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.6638787984848022},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5617464184761047},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.5494517683982849},{"id":"https://openalex.org/C135252773","wikidata":"https://www.wikidata.org/wiki/Q1567213","display_name":"Inverse problem","level":2,"score":0.5227006673812866},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.41227641701698303},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4023595452308655},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.3576394021511078},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3246528208255768},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.11812898516654968},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.08686724305152893},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1051/ro:2008017","is_oa":false,"landing_page_url":"https://doi.org/10.1051/ro:2008017","pdf_url":null,"source":{"id":"https://openalex.org/S20631277","display_name":"RAIRO - Operations Research","issn_l":"0399-0559","issn":["0399-0559","1290-3868","2804-7303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319748","host_organization_name":"EDP Sciences","host_organization_lineage":["https://openalex.org/P4310319748","https://openalex.org/P4310319982"],"host_organization_lineage_names":["EDP Sciences","Science Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"RAIRO - Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:numdam.org:RO_2008__42_3_401_0","is_oa":false,"landing_page_url":"https://www.numdam.org/articles/10.1051/ro:2008017/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402264","display_name":"French digital mathematics library (Numdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I70900168","host_organization_name":"Universit\u00e9 Savoie Mont Blanc","host_organization_lineage":["https://openalex.org/I70900168"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W202842168","https://openalex.org/W1977545325","https://openalex.org/W1979134936","https://openalex.org/W1986946117","https://openalex.org/W2001098058","https://openalex.org/W2014993890","https://openalex.org/W2018562299","https://openalex.org/W2056739933","https://openalex.org/W2143676338","https://openalex.org/W2171588996","https://openalex.org/W2338905098","https://openalex.org/W2783518218"],"related_works":["https://openalex.org/W2356364244","https://openalex.org/W2298446516","https://openalex.org/W2641655","https://openalex.org/W3007430728","https://openalex.org/W2339811963","https://openalex.org/W2080181849","https://openalex.org/W2124458868","https://openalex.org/W2078520445","https://openalex.org/W2388390852","https://openalex.org/W1512208174"],"abstract_inverted_index":{"The":[0,72,99,110],"problem":[1,48,114],"is":[2,32,49,55,64,96,141],"to":[3,105],"modify":[4],"the":[5,8,24,28,56,65,70,81,88],"capacities":[6,29],"of":[7,27,58,67,69,80],"arcs":[9,31,59],"from":[10],"a":[11,15,20,93],"network":[12],"so":[13,86],"that":[14,87],"given":[16,89],"feasible":[17,90],"flow":[18,22,82,91,95,113],"becomes":[19,92],"maximum":[21,25,94],"and":[23,60,77],"change":[26],"on":[30],"minimum.":[33],"A":[34],"very":[35],"fast":[36],"O(m":[38],"\u22c5log(":[39],"n":[40,62],"))":[41],"time":[42],"complexity":[43],"algorithm":[44,100],"for":[45],"solving":[46],"this":[47,107],"presented,":[50],"where":[51],"m":[53],"number":[57,66],"nodes":[68],"network.":[71],"case":[73],"when":[74],"both,":[75],"lower":[76],"upper":[78],"bounds":[79],"can":[83,102],"be":[84,103],"modified":[85],"also":[97,142],"discussed.":[98],"proposed":[101],"adapted":[104],"solve":[106],"problem,":[108],"too.":[109],"inverse":[111],"minimum":[112],"considering":[115],"l":[117],"\u221e":[138],"norm":[140],"studied.":[143]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}