{"id":"https://openalex.org/W3111971650","doi":"https://doi.org/10.1109/access.2020.3045288","title":"Inverse Maximum Capacity Path Problems Under Sum-Type and Max-Type Distances and Their Practical Application to Transportation Networks","display_name":"Inverse Maximum Capacity Path Problems Under Sum-Type and Max-Type Distances and Their Practical Application to Transportation Networks","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3111971650","doi":"https://doi.org/10.1109/access.2020.3045288","mag":"3111971650"},"language":"en","primary_location":{"id":"doi:10.1109/access.2020.3045288","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3045288","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09296205.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09296205.pdf","any_repository_has_fulltext":true},"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":false,"raw_author_name":"Adrian M. Deaconu","raw_affiliation_strings":["Department of Mathematics and Computer Science, University Transilvania, Braşov, Romania"],"raw_orcid":"https://orcid.org/0000-0002-1070-1383","affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University Transilvania, Braşov, Romania","institution_ids":["https://openalex.org/I3123573182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047879098","display_name":"Javad Tayyebi","orcid":"https://orcid.org/0000-0002-7559-3870"},"institutions":[{"id":"https://openalex.org/I97626857","display_name":"University of Birjand","ror":"https://ror.org/03g4hym73","country_code":"IR","type":"education","lineage":["https://openalex.org/I97626857"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Javad Tayyebi","raw_affiliation_strings":["Department of Industrial Engineering, Birjand University of Technology, Birjand, Iran"],"raw_orcid":"https://orcid.org/0000-0002-7559-3870","affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Birjand University of Technology, Birjand, Iran","institution_ids":["https://openalex.org/I97626857"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1750,"currency":"USD","value_usd":1750},"apc_paid":{"value":1750,"currency":"USD","value_usd":1750},"fwci":0.3029,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.77284454,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"8","issue":null,"first_page":"225957","last_page":"225966"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.989799976348877,"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/T14304","display_name":"Transport Systems and Technology","score":0.947700023651123,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/inverse","display_name":"Inverse","score":0.6576080322265625},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.6396751403808594},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.627977728843689},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5587399005889893},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5568761825561523},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5556509494781494},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.5132653713226318},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.44695883989334106},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.437005877494812},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.43666309118270874},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33644625544548035},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.329558789730072},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07948076725006104},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.06919944286346436}],"concepts":[{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.6576080322265625},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.6396751403808594},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.627977728843689},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5587399005889893},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5568761825561523},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5556509494781494},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.5132653713226318},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.44695883989334106},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.437005877494812},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.43666309118270874},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33644625544548035},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.329558789730072},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07948076725006104},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.06919944286346436},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2020.3045288","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3045288","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09296205.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:2b9d0a70e26648d8bd0502cbaa445575","is_oa":true,"landing_page_url":"https://doaj.org/article/2b9d0a70e26648d8bd0502cbaa445575","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, Vol 8, Pp 225957-225966 (2020)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1109/access.2020.3045288","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2020.3045288","pdf_url":"https://ieeexplore.ieee.org/ielx7/6287639/6514899/09296205.pdf","source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322623","display_name":"Universitatea Transilvania din Brasov","ror":"https://ror.org/01cg9ws23"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3111971650.pdf","grobid_xml":"https://content.openalex.org/works/W3111971650.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1503010356","https://openalex.org/W1592187865","https://openalex.org/W1907521806","https://openalex.org/W1977545325","https://openalex.org/W1979134936","https://openalex.org/W1983383464","https://openalex.org/W2027482741","https://openalex.org/W2037412278","https://openalex.org/W2039796154","https://openalex.org/W2057801831","https://openalex.org/W2058946929","https://openalex.org/W2090820749","https://openalex.org/W2166327708","https://openalex.org/W2171588996","https://openalex.org/W2673609806","https://openalex.org/W2734739073","https://openalex.org/W2911796152","https://openalex.org/W3049406940","https://openalex.org/W3162980570","https://openalex.org/W6630055753","https://openalex.org/W6684818764"],"related_works":["https://openalex.org/W2595172197","https://openalex.org/W2084856301","https://openalex.org/W2127970246","https://openalex.org/W2885125400","https://openalex.org/W1989889224","https://openalex.org/W4382618745","https://openalex.org/W1973775000","https://openalex.org/W2748922771","https://openalex.org/W1987128138","https://openalex.org/W2743976221"],"abstract_inverted_index":{"The":[0,28,101],"maximum":[1,30,53],"capacity":[2,22,31,54,67],"path":[3,9,25,32,51,55,71],"problem":[4,33],"is":[5,26,35,72,77],"to":[6,36,108],"find":[7],"a":[8,15,49,110],"connecting":[10],"two":[11],"given":[12,50,70],"nodes":[13],"in":[14,56],"network":[16,114],"such":[17],"that":[18,48],"the":[19,38,41,57,66,69],"minimum":[20],"arc":[21],"on":[23],"this":[24],"maximized.":[27],"inverse":[29],"(IMCP)":[34],"modify":[37],"capacities":[39],"of":[40,62,68],"arcs":[42],"as":[43,45],"little":[44],"possible":[46],"so":[47],"becomes":[52],"modified":[58],"network.":[59],"Two":[60],"cases":[61],"IMCP":[63,76,105],"are":[64,106],"considered:":[65],"preserved":[73],"or":[74,97],"not.":[75],"studied":[78],"and":[79,87,91],"solved":[80],"both,":[81],"under":[82],"any":[83],"sum-type":[84,88],"(e.g.,":[85,94],"weighted$l_{k}$norms":[86],"Hamming":[89,99],"distance)":[90],"max-type":[92],"distance":[93],"weighted$l_{\\infty":[95],"}$norm":[96],"bottleneck":[98],"distance).":[100],"obtained":[102],"algorithms":[103],"for":[104],"applied":[107],"solve":[109],"real":[111],"road":[112],"transportation":[113],"optimization":[115],"problem.":[116]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-08-28T12:50:07.497085","created_date":"2025-10-10T00:00:00"}