{"id":"https://openalex.org/W1990452201","doi":"https://doi.org/10.1137/s1052623496304542","title":"Progress Made in Solving the Multicommodity Flow Problem","display_name":"Progress Made in Solving the Multicommodity Flow Problem","publication_year":1998,"publication_date":"1998-11-01","ids":{"openalex":"https://openalex.org/W1990452201","doi":"https://doi.org/10.1137/s1052623496304542","mag":"1990452201"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623496304542","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623496304542","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/A5008959882","display_name":"Richard D. McBride","orcid":"https://orcid.org/0009-0005-6749-3801"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Richard D. McBride","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5008959882"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.3392,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.96522782,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"8","issue":"4","first_page":"947","last_page":"955"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.967199981212616,"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.967199981212616,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9670000076293945,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9659000039100647,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.8844223022460938},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7477978467941284},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7087225317955017},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6359363198280334},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.5534772276878357},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5205929279327393},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.5057892799377441},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.46846362948417664},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3881824016571045}],"concepts":[{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.8844223022460938},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7477978467941284},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7087225317955017},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6359363198280334},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.5534772276878357},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5205929279327393},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.5057892799377441},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.46846362948417664},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3881824016571045},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s1052623496304542","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623496304542","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":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1524804355","https://openalex.org/W1971504584","https://openalex.org/W1994327654","https://openalex.org/W2007549096","https://openalex.org/W2012464173","https://openalex.org/W2015560695","https://openalex.org/W2042061024","https://openalex.org/W2052321453","https://openalex.org/W2059135758","https://openalex.org/W2063317370","https://openalex.org/W2108201835","https://openalex.org/W2130805885","https://openalex.org/W2149705873","https://openalex.org/W2162499224"],"related_works":["https://openalex.org/W2133667137","https://openalex.org/W2380756614","https://openalex.org/W2371762379","https://openalex.org/W4295094535","https://openalex.org/W4283583523","https://openalex.org/W4291914418","https://openalex.org/W4249359625","https://openalex.org/W2144476187","https://openalex.org/W2625547693","https://openalex.org/W2043901793"],"abstract_inverted_index":{"During":[0],"the":[1,12,39,71,82],"past":[2],"few":[3],"years,":[4],"steady":[5],"progress":[6],"has":[7],"been":[8],"made":[9,30],"in":[10,77],"solving":[11],"multicommodity":[13,43,61],"flow":[14,44,62],"problem":[15],"using":[16],"EMNET,":[17],"a":[18,27],"primal":[19],"partitioning":[20],"network":[21],"simplex":[22],"algorithm.":[23],"This":[24],"paper":[25],"describes":[26],"recent":[28],"improvement":[29],"to":[31,36,56,88],"EMNET":[32],"which":[33],"permits":[34],"it":[35],"dramatically":[37],"reduce":[38],"solution":[40],"time":[41],"for":[42],"problems":[45,63,80],"with":[46,70,81],"large":[47,60],"numbers":[48],"of":[49,84],"side":[50],"constraints.":[51],"It":[52],"is":[53,68],"now":[54],"possible":[55],"efficiently":[57],"solve":[58],"extremely":[59],"when":[64],"this":[65],"new":[66],"idea":[67],"coupled":[69],"resource-directive":[72],"decomposition":[73],"heuristic":[74],"as":[75],"found":[76],"EMNET.":[78,94],"Commercial":[79],"number":[83],"constraints":[85],"ranging":[86],"up":[87],"600,000":[89],"are":[90],"routinely":[91],"solved":[92],"by":[93]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}