{"id":"https://openalex.org/W2883274460","doi":"https://doi.org/10.1137/17m1137553","title":"A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems","display_name":"A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2883274460","doi":"https://doi.org/10.1137/17m1137553","mag":"2883274460"},"language":"en","primary_location":{"id":"doi:10.1137/17m1137553","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1137553","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","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/A5006136010","display_name":"Christopher Ryan","orcid":"https://orcid.org/0000-0002-1957-2303"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Christopher Thomas Ryan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102899461","display_name":"Robert L. Smith","orcid":"https://orcid.org/0000-0002-4669-8948"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert L. Smith","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5013764577","display_name":"Marina A. Epelman","orcid":"https://orcid.org/0000-0002-0056-1583"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Marina A. Epelman","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5006136010"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9405,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.8767209,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"28","issue":"3","first_page":"2022","last_page":"2048"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10768","display_name":"Electric Vehicles and Infrastructure","score":0.9606999754905701,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T11413","display_name":"Risk and Portfolio Optimization","score":0.9580000042915344,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7344233989715576},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6540618538856506},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.627924919128418},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.6062931418418884},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.5504428744316101},{"id":"https://openalex.org/keywords/duality","display_name":"Duality (order theory)","score":0.5104050040245056},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5094583630561829},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5080294609069824},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.47664862871170044},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.43772774934768677},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.4199877977371216},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4156806468963623},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22640490531921387},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.17663538455963135},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13502758741378784}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7344233989715576},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6540618538856506},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.627924919128418},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.6062931418418884},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.5504428744316101},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.5104050040245056},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5094583630561829},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5080294609069824},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.47664862871170044},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.43772774934768677},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.4199877977371216},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4156806468963623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22640490531921387},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.17663538455963135},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13502758741378784},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/17m1137553","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1137553","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4827356327","display_name":null,"funder_award_id":"CMMI-1333260","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W133224232","https://openalex.org/W2008634162","https://openalex.org/W2035320001","https://openalex.org/W2037249457","https://openalex.org/W2047062244","https://openalex.org/W2051994935","https://openalex.org/W2056178482","https://openalex.org/W2066957127","https://openalex.org/W2084071948","https://openalex.org/W2127533431","https://openalex.org/W2160154266","https://openalex.org/W2162748558","https://openalex.org/W2295287556","https://openalex.org/W2737963458","https://openalex.org/W2755023938","https://openalex.org/W4241474317","https://openalex.org/W4255867662","https://openalex.org/W4256185527"],"related_works":["https://openalex.org/W2185826091","https://openalex.org/W2048470382","https://openalex.org/W2477407501","https://openalex.org/W2384679317","https://openalex.org/W2911215968","https://openalex.org/W1570109187","https://openalex.org/W1583787753","https://openalex.org/W2491692165","https://openalex.org/W2366013513","https://openalex.org/W4244786412"],"abstract_inverted_index":{"We":[0],"provide":[1],"a":[2,6,35,40,76,109],"simplex":[3,41,129],"algorithm":[4,130],"for":[5,65,133],"structured":[7],"class":[8],"of":[9,55,60,67,94,111,127],"uncapacitated":[10],"countably":[11],"infinite":[12,135],"network":[13],"flow":[14],"problems.":[15],"Previous":[16],"efforts":[17],"required":[18],"explicit":[19,68],"capacities":[20],"on":[21,53,75],"arcs":[22],"with":[23,92],"uniformity":[24],"properties":[25],"that":[26,43],"facilitate":[27],"duality":[28],"arguments.":[29],"By":[30],"contrast,":[31],"this":[32],"paper":[33],"takes":[34],"\u201cprimal\u201d":[36],"approach":[37],"by":[38],"devising":[39],"method":[42,72,84],"provably":[44],"converges":[45],"to":[46,78,87,116],"the":[47,134],"optimal":[48,81],"value":[49],"using":[50],"arguments":[51],"based":[52],"convergence":[54],"spanning":[56],"trees":[57],"and":[58],"nonnegativity":[59],"reduced":[61],"costs.":[62,142],"This":[63],"allows":[64],"removal":[66],"capacity":[69],"bounds.":[70],"The":[71,102],"also":[73],"converges,":[74],"subsequence,":[77],"an":[79],"extremal":[80],"solution.":[82],"Our":[83],"is":[85,131],"tailored":[86],"our":[88,128],"problem":[89,139],"setting---acyclic":[90],"networks":[91],"nodes":[93],"only":[95,100],"nonnegative":[96],"supplies":[97],"(or,":[98],"alternatively,":[99],"demands).":[101],"necessary":[103],"structure":[104],"can":[105],"be":[106],"found":[107],"in":[108],"variety":[110],"applied":[112],"settings":[113],"not":[114],"amenable":[115],"existing":[117],"methods,":[118],"including":[119],"nonstationary":[120],"infinite-horizon":[121],"dynamic":[122,137],"programming.":[123],"A":[124],"finite":[125],"implementation":[126],"provided":[132],"horizon":[136],"lot-sizing":[138],"under":[140],"linear":[141]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}