{"id":"https://openalex.org/W4407938902","doi":"https://doi.org/10.1002/net.22272","title":"The Minimum\u2010Cost Dynamic Flow Problem in a Fixed Graph With a Constant Target Flow Value","display_name":"The Minimum\u2010Cost Dynamic Flow Problem in a Fixed Graph With a Constant Target Flow Value","publication_year":2025,"publication_date":"2025-02-24","ids":{"openalex":"https://openalex.org/W4407938902","doi":"https://doi.org/10.1002/net.22272"},"language":"en","primary_location":{"id":"doi:10.1002/net.22272","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.22272","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.22272","source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.22272","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004110613","display_name":"Naoyuki Kamiyama","orcid":"https://orcid.org/0000-0002-7712-2730"},"institutions":[{"id":"https://openalex.org/I135598925","display_name":"Kyushu University","ror":"https://ror.org/00p4k0j84","country_code":"JP","type":"education","lineage":["https://openalex.org/I135598925"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Naoyuki Kamiyama","raw_affiliation_strings":["Institute of Mathematics for Industry Kyushu University  Fukuoka Japan"],"raw_orcid":"https://orcid.org/0000-0002-7712-2730","affiliations":[{"raw_affiliation_string":"Institute of Mathematics for Industry Kyushu University  Fukuoka Japan","institution_ids":["https://openalex.org/I135598925"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004110613"],"corresponding_institution_ids":["https://openalex.org/I135598925"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.1789,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.78306743,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"85","issue":"4","first_page":"437","last_page":"444"},"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.9994999766349792,"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.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9916999936103821,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/constant","display_name":"Constant (computer programming)","score":0.6761860847473145},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.6350646018981934},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5752313137054443},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.5723035931587219},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5678343176841736},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5289160013198853},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47013431787490845},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45811834931373596},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.44222551584243774},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4104347825050354},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.33978015184402466},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07462504506111145},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.06500968337059021}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6761860847473145},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.6350646018981934},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5752313137054443},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.5723035931587219},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5678343176841736},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5289160013198853},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47013431787490845},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45811834931373596},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.44222551584243774},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4104347825050354},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.33978015184402466},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07462504506111145},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.06500968337059021},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.22272","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.22272","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.22272","source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1002/net.22272","is_oa":true,"landing_page_url":"https://doi.org/10.1002/net.22272","pdf_url":"https://onlinelibrary.wiley.com/doi/pdfdirect/10.1002/net.22272","source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2953040446","display_name":null,"funder_award_id":"JP24K14825","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4407938902.pdf"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1490625391","https://openalex.org/W1968268863","https://openalex.org/W1977545325","https://openalex.org/W2008133042","https://openalex.org/W2066074485","https://openalex.org/W2076171427","https://openalex.org/W2096774592","https://openalex.org/W2114616381","https://openalex.org/W2170193147","https://openalex.org/W2234958105","https://openalex.org/W2401610261","https://openalex.org/W2566954515","https://openalex.org/W2898263215","https://openalex.org/W2972681478","https://openalex.org/W3194490636","https://openalex.org/W4211250771","https://openalex.org/W4229841241"],"related_works":["https://openalex.org/W3141113327","https://openalex.org/W3035974271","https://openalex.org/W2080904092","https://openalex.org/W4231500168","https://openalex.org/W3161514703","https://openalex.org/W2374451529","https://openalex.org/W2151525839","https://openalex.org/W2098682899","https://openalex.org/W1994440468","https://openalex.org/W2764325809"],"abstract_inverted_index":{"ABSTRACT":[0],"A":[1,18],"dynamic":[2,19,27,37,41,64],"network":[3,42],"is":[4,21,50,55,74,80,102,109,117],"a":[5,12,15,22,26,35,40,47,68,72,76,82,118],"directed":[6],"graph":[7,70,73],"where":[8,43],"an":[9,44,110],"arc":[10,45,101,108],"has":[11,46],"capacity":[13,105],"and":[14,58,78,112],"transit":[16],"time.":[17,92,129],"flow":[20,23,38,65,115],"defined":[24],"in":[25,39,67,90,127],"network.":[28],"We":[29,93],"consider":[30],"the":[31,62,85,97,104,113],"problem":[32,54,66,123],"of":[33,84,99,106],"finding":[34],"minimum\u2010cost":[36,63],"cost.":[48],"It":[49],"known":[51],"that":[52,95],"this":[53,122],"NP\u2010hard.":[56],"Klinz":[57],"Woeginger":[59],"asked":[60],"whether":[61],"fixed":[69],"(i.e.,":[71],"given":[75],"priori,":[77],"it":[79],"not":[81],"part":[83],"input)":[86],"can":[87,124],"be":[88,125],"solved":[89,126],"polynomial":[91,128],"prove":[94],"if":[96],"cost":[98],"each":[100,107],"non\u2010negative,":[103],"integer,":[111,120],"target":[114],"value":[116],"constant":[119],"then":[121]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}