{"id":"https://openalex.org/W2016642097","doi":"https://doi.org/10.1002/net.3230150107","title":"A minimum concave\u2010cost dynamic network flow problem with an application to lot\u2010sizing","display_name":"A minimum concave\u2010cost dynamic network flow problem with an application to lot\u2010sizing","publication_year":1985,"publication_date":"1985-03-01","ids":{"openalex":"https://openalex.org/W2016642097","doi":"https://doi.org/10.1002/net.3230150107","mag":"2016642097"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230150107","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230150107","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/A5017016232","display_name":"Stephen C. Graves","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Stephen C. Graves","raw_affiliation_strings":["Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072685560","display_name":"James B. Orlin","orcid":"https://orcid.org/0000-0002-7488-094X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"James B. Orlin","raw_affiliation_strings":["Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sloan School of Management, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.4812,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.82977758,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"15","issue":"1","first_page":"59","last_page":"71"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9943000078201294,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9836000204086304,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/sizing","display_name":"Sizing","score":0.8291412591934204},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.7842238545417786},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7194292545318604},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.7187138795852661},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.5476903915405273},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5125494003295898},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5059987902641296},{"id":"https://openalex.org/keywords/time-horizon","display_name":"Time horizon","score":0.4955850839614868},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34983181953430176}],"concepts":[{"id":"https://openalex.org/C2777767291","wikidata":"https://www.wikidata.org/wiki/Q1080291","display_name":"Sizing","level":2,"score":0.8291412591934204},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.7842238545417786},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7194292545318604},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.7187138795852661},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.5476903915405273},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5125494003295898},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5059987902641296},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.4955850839614868},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34983181953430176},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/net.3230150107","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230150107","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:CiteSeerX.psu:10.1.1.297.2931","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.2931","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://jorlin.scripts.mit.edu/docs/publications/18-minimum concave cost.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1969625919","https://openalex.org/W2009409317","https://openalex.org/W2011039300","https://openalex.org/W2012329067","https://openalex.org/W2028145673","https://openalex.org/W2038676869","https://openalex.org/W2055275666","https://openalex.org/W2072031112","https://openalex.org/W2073540225","https://openalex.org/W2096586036","https://openalex.org/W2107857629","https://openalex.org/W2113147495","https://openalex.org/W2125690626","https://openalex.org/W2136646817","https://openalex.org/W2163534333","https://openalex.org/W2168795829","https://openalex.org/W2227557434","https://openalex.org/W3149578739","https://openalex.org/W4256185527","https://openalex.org/W4285719527"],"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/W1970952976","https://openalex.org/W2069541586","https://openalex.org/W118936824"],"abstract_inverted_index":{"Abstract":[0],"We":[1,28],"consider":[2],"a":[3,9],"minimum\u2010cost":[4],"dynamic":[5],"network\u2010flow":[6],"problem":[7,16,21],"on":[8],"very":[10],"special":[11],"network.":[12],"This":[13],"network":[14],"flow":[15],"models":[17],"an":[18],"infinite\u2010horizon,":[19],"lot\u2010sizing":[20],"with":[22],"deterministic":[23],"demand":[24],"and":[25,38,58],"periodic":[26],"data.":[27],"permit":[29],"two":[30],"different":[31],"objectives:":[32],"minimize":[33,39],"long\u2010run":[34],"average\u2010cost":[35],"per":[36],"period":[37],"the":[40],"discounted":[41],"cost.":[42],"In":[43],"both":[44],"cases":[45],"we":[46],"give":[47],"polynomial":[48],"algorithms":[49],"when":[50],"certain":[51],"arc":[52],"costs":[53],"are":[54,60],"fixed":[55],"charge":[56],"functions,":[57],"others":[59],"linear.":[61]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}