{"id":"https://openalex.org/W2005859793","doi":"https://doi.org/10.1007/bf01584987","title":"A partitioning algorithm for the multicommodity network flow problem","display_name":"A partitioning algorithm for the multicommodity network flow problem","publication_year":1972,"publication_date":"1972-12-01","ids":{"openalex":"https://openalex.org/W2005859793","doi":"https://doi.org/10.1007/bf01584987","mag":"2005859793"},"language":"en","primary_location":{"id":"doi:10.1007/bf01584987","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01584987","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5084098678","display_name":"Michael D. Grigoriadis","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. D. Grigoriadis","raw_affiliation_strings":["IBM Data Processing Division, New York, N.Y., USA","IBM Data Processing Division, New York, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Data Processing Division, New York, N.Y., USA","institution_ids":["https://openalex.org/I1341412227"]},{"raw_affiliation_string":"IBM Data Processing Division, New York, USA#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000892961","display_name":"William White","orcid":"https://orcid.org/0000-0002-5863-3092"},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]},{"id":"https://openalex.org/I4210087032","display_name":"Cambridge Scientific (United States)","ror":"https://ror.org/001s4dh65","country_code":"US","type":"company","lineage":["https://openalex.org/I4210087032"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"W. W. White","raw_affiliation_strings":["IBM Scientific Center, Philadelphia, Pa., USA","IBM Scientific Center, Philadelphia, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Scientific Center, Philadelphia, Pa., USA","institution_ids":["https://openalex.org/I4210087032"]},{"raw_affiliation_string":"IBM Scientific Center, Philadelphia, USA#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":12.9509,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.97878945,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3-3","issue":"1","first_page":"157","last_page":"177"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9986000061035156,"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/T10524","display_name":"Traffic control and management","score":0.9814000129699707,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T12546","display_name":"Smart Parking Systems Research","score":0.9710999727249146,"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/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.835166335105896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7080162167549133},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.6990309357643127},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6749389171600342},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.6561248302459717},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6350301504135132},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5752040147781372},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5312893986701965},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5294893383979797},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.5118224024772644},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.4998319149017334},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4967220425605774},{"id":"https://openalex.org/keywords/out-of-kilter-algorithm","display_name":"Out-of-kilter algorithm","score":0.46515947580337524},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.4365331530570984},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.4341449737548828},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4106454849243164},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26913177967071533},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2070567011833191},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.19506332278251648},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13959085941314697},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.07807859778404236}],"concepts":[{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.835166335105896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7080162167549133},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.6990309357643127},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6749389171600342},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.6561248302459717},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6350301504135132},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5752040147781372},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5312893986701965},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5294893383979797},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5118224024772644},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.4998319149017334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4967220425605774},{"id":"https://openalex.org/C133824558","wikidata":"https://www.wikidata.org/wiki/Q16893660","display_name":"Out-of-kilter algorithm","level":5,"score":0.46515947580337524},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.4365331530570984},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.4341449737548828},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4106454849243164},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26913177967071533},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2070567011833191},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.19506332278251648},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13959085941314697},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.07807859778404236},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01584987","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01584987","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":29,"referenced_works":["https://openalex.org/W228688591","https://openalex.org/W326594032","https://openalex.org/W572976401","https://openalex.org/W1481747975","https://openalex.org/W1524804355","https://openalex.org/W1983743030","https://openalex.org/W1989309663","https://openalex.org/W1996622306","https://openalex.org/W1997231674","https://openalex.org/W2003662390","https://openalex.org/W2021036157","https://openalex.org/W2042061024","https://openalex.org/W2045699373","https://openalex.org/W2049446751","https://openalex.org/W2051000746","https://openalex.org/W2063965788","https://openalex.org/W2077122251","https://openalex.org/W2096586036","https://openalex.org/W2135986386","https://openalex.org/W2139805900","https://openalex.org/W2150815458","https://openalex.org/W2190657079","https://openalex.org/W2240264416","https://openalex.org/W4231610975","https://openalex.org/W4244424643","https://openalex.org/W4246323195","https://openalex.org/W4285719527","https://openalex.org/W6603749998","https://openalex.org/W6731447265"],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W4206915070","https://openalex.org/W3161514703","https://openalex.org/W3141113327","https://openalex.org/W2625547693","https://openalex.org/W2531764854","https://openalex.org/W2355612523","https://openalex.org/W2963592990","https://openalex.org/W2051329268","https://openalex.org/W2366102085"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2025-10-10T00:00:00"}