{"id":"https://openalex.org/W2060875027","doi":"https://doi.org/10.1002/net.3230240805","title":"An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions","display_name":"An algorithm for generating minimum cost network flow problems with specific structure and known optimal solutions","publication_year":1994,"publication_date":"1994-12-01","ids":{"openalex":"https://openalex.org/W2060875027","doi":"https://doi.org/10.1002/net.3230240805","mag":"2060875027"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230240805","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230240805","pdf_url":null,"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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5041528233","display_name":"Jeffrey L. Arthur","orcid":null},"institutions":[{"id":"https://openalex.org/I131249849","display_name":"Oregon State University","ror":"https://ror.org/00ysfqy60","country_code":"US","type":"education","lineage":["https://openalex.org/I131249849"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jeffrey L. Arthur","raw_affiliation_strings":["Department of Statistics, Oregon State University, Corvallis, Oregon 97331","Department of Statistics , Oregon State University , Corvallis, Oregon, 97331"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Statistics, Oregon State University, Corvallis, Oregon 97331","institution_ids":["https://openalex.org/I131249849"]},{"raw_affiliation_string":"Department of Statistics , Oregon State University , Corvallis, Oregon, 97331","institution_ids":["https://openalex.org/I131249849"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002165347","display_name":"James O. Frendewey","orcid":null},"institutions":[{"id":"https://openalex.org/I11957088","display_name":"Michigan Technological University","ror":"https://ror.org/0036rpn28","country_code":"US","type":"education","lineage":["https://openalex.org/I11957088"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James O. Frendewey","raw_affiliation_strings":["Department of Operations Management, School of Business and Engineering Administration, Michigan Technological University, Houghton, Michigan 49931"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Operations Management, School of Business and Engineering Administration, Michigan Technological University, Houghton, Michigan 49931","institution_ids":["https://openalex.org/I11957088"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.0375,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.79553903,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":"8","first_page":"445","last_page":"454"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9983000159263611,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.7882716655731201},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6986491680145264},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6950096487998962},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6595720052719116},{"id":"https://openalex.org/keywords/transshipment","display_name":"Transshipment (information security)","score":0.630678653717041},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6118277907371521},{"id":"https://openalex.org/keywords/generator","display_name":"Generator (circuit theory)","score":0.5723533034324646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5439832210540771},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5122453570365906},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.511735200881958},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.49531927704811096},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4685075581073761},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4661160111427307},{"id":"https://openalex.org/keywords/out-of-kilter-algorithm","display_name":"Out-of-kilter algorithm","score":0.42075926065444946},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.3945462703704834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2805420756340027},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13849523663520813},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.137810617685318},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.12028342485427856}],"concepts":[{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.7882716655731201},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6986491680145264},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6950096487998962},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6595720052719116},{"id":"https://openalex.org/C2776234997","wikidata":"https://www.wikidata.org/wiki/Q17134191","display_name":"Transshipment (information security)","level":2,"score":0.630678653717041},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6118277907371521},{"id":"https://openalex.org/C2780992000","wikidata":"https://www.wikidata.org/wiki/Q17016113","display_name":"Generator (circuit theory)","level":3,"score":0.5723533034324646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5439832210540771},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5122453570365906},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.511735200881958},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.49531927704811096},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4685075581073761},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4661160111427307},{"id":"https://openalex.org/C133824558","wikidata":"https://www.wikidata.org/wiki/Q16893660","display_name":"Out-of-kilter algorithm","level":5,"score":0.42075926065444946},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3945462703704834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2805420756340027},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13849523663520813},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.137810617685318},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.12028342485427856},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/net.3230240805","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230240805","pdf_url":null,"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"},{"id":"pmh:oai:digitalcommons.mtu.edu:michigantech-p-23097","is_oa":false,"landing_page_url":"https://digitalcommons.mtu.edu/michigantech-p/3795","pdf_url":null,"source":{"id":"https://openalex.org/S4377196391","display_name":"Digital Commons - Michigan Tech (Michigan Technological University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I11957088","host_organization_name":"Michigan Technological University","host_organization_lineage":["https://openalex.org/I11957088"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Michigan Tech Publications, Part 1","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":16,"referenced_works":["https://openalex.org/W118742285","https://openalex.org/W1488487320","https://openalex.org/W1489273657","https://openalex.org/W1536161928","https://openalex.org/W1545925697","https://openalex.org/W1561880747","https://openalex.org/W1970263822","https://openalex.org/W1980888850","https://openalex.org/W1993970450","https://openalex.org/W1998022314","https://openalex.org/W2033982221","https://openalex.org/W2063466248","https://openalex.org/W2163428398","https://openalex.org/W2987803397","https://openalex.org/W3174107850","https://openalex.org/W4242600577"],"related_works":["https://openalex.org/W2625547693","https://openalex.org/W4206915070","https://openalex.org/W2080904092","https://openalex.org/W2355612523","https://openalex.org/W2531764854","https://openalex.org/W2366102085","https://openalex.org/W3006069386","https://openalex.org/W2108800124","https://openalex.org/W3161514703","https://openalex.org/W2089521921"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"new":[2],"algorithm":[3],"for":[4],"generating":[5],"structured,":[6],"minimum":[7],"cost":[8],"network":[9],"flow":[10],"problems":[11,30,49],"(transshipment,":[12],"transportation,":[13],"assignment,":[14],"and":[15],"shortest":[16],"path)":[17],"with":[18],"known":[19],"optimal":[20,33],"solutions":[21,40],"is":[22,26],"described.":[23],"The":[24],"procedure":[25],"based":[27],"on":[28],"developing":[29],"around":[31],"an":[32],"basis":[34],"so":[35],"that":[36,47],"the":[37,48,61,68,77],"characteristics":[38],"of":[39,74],"can":[41],"be":[42],"controlled.":[43],"Computational":[44],"tests":[45],"show":[46],"generated":[50],"are":[51,57],"as":[52,56],"difficult":[53],"to":[54],"solve":[55],"those":[58],"produced":[59],"by":[60,82],"commonly":[62],"used":[63],"generator":[64],"NETGEN,":[65],"while":[66],"allowing":[67],"user":[69],"a":[70],"much":[71],"greater":[72],"degree":[73],"control":[75],"over":[76],"resulting":[78],"problems.":[79],"\u00a9":[80],"1994":[81],"John":[83],"Wiley":[84],"&":[85],"Sons,":[86],"Inc.":[87]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}