{"id":"https://openalex.org/W2169627377","doi":"https://doi.org/10.1002/net.3230070105","title":"A primal algorithm for solving a capacitated network flow problem with additional linear constraints","display_name":"A primal algorithm for solving a capacitated network flow problem with additional linear constraints","publication_year":1977,"publication_date":"1977-03-01","ids":{"openalex":"https://openalex.org/W2169627377","doi":"https://doi.org/10.1002/net.3230070105","mag":"2169627377"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230070105","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230070105","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/A5091793490","display_name":"S. Chen","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"S. Chen","raw_affiliation_strings":["Bell Laboratories Holmdel, New Jersey"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories Holmdel, New Jersey","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067806633","display_name":"Romesh Saigal","orcid":"https://orcid.org/0000-0001-8086-9328"},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Saigal","raw_affiliation_strings":["Northwestern University Evanston, Illinois"],"affiliations":[{"raw_affiliation_string":"Northwestern University Evanston, Illinois","institution_ids":["https://openalex.org/I111979921"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5091793490"],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":5.256,"has_fulltext":false,"cited_by_count":63,"citation_normalized_percentile":{"value":0.95982906,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":"1","first_page":"59","last_page":"79"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9991000294685364,"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"}},"topics":[{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9991000294685364,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.8423929214477539},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.7457882165908813},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6420678496360779},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6029918193817139},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5887115597724915},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5860738754272461},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5854972004890442},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.5666174292564392},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.541377604007721},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.4734503924846649},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4684251546859741},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.45106297731399536},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.4253289997577667},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.36017757654190063},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3277704119682312}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.8423929214477539},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.7457882165908813},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6420678496360779},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6029918193817139},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5887115597724915},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5860738754272461},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5854972004890442},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.5666174292564392},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.541377604007721},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.4734503924846649},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4684251546859741},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.45106297731399536},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.4253289997577667},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.36017757654190063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3277704119682312},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230070105","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230070105","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1481747975","https://openalex.org/W1655990431","https://openalex.org/W1964119857","https://openalex.org/W1981663184","https://openalex.org/W1991616395","https://openalex.org/W1997231674","https://openalex.org/W2024684012","https://openalex.org/W2024855029","https://openalex.org/W2046215222","https://openalex.org/W2050699940","https://openalex.org/W2089066742","https://openalex.org/W2096171298","https://openalex.org/W2118382442","https://openalex.org/W2139805900","https://openalex.org/W2326587081","https://openalex.org/W2330342547","https://openalex.org/W3198160809","https://openalex.org/W4234099403","https://openalex.org/W4244424643"],"related_works":["https://openalex.org/W2625547693","https://openalex.org/W4205348974","https://openalex.org/W2133667137","https://openalex.org/W2007464938","https://openalex.org/W2784100870","https://openalex.org/W2293098548","https://openalex.org/W2337360258","https://openalex.org/W4214624958","https://openalex.org/W2385011829","https://openalex.org/W2029479369"],"abstract_inverted_index":{"Abstract":[0],"A":[1],"variant":[2],"of":[3,37,43,62],"the":[4,41],"revised":[5],"simplex":[6],"method":[7],"is":[8],"given":[9],"for":[10,47,53],"solving":[11],"capacitated":[12],"network":[13],"flow":[14],"problems":[15],"with":[16],"additional":[17,44],"linear":[18,45,67],"constraints.":[19],"The":[20,30],"mathematical":[21],"development,":[22],"computer":[23],"implementation":[24],"and":[25,50],"computational":[26],"experience":[27],"are":[28],"presented.":[29],"algorithm":[31],"described":[32],"uses":[33],"a":[34,59,65],"working":[35],"basis":[36],"size":[38],"equal":[39],"to":[40],"number":[42],"constraints":[46],"pivoting,":[48],"pricing,":[49],"inversion,":[51],"which":[52],"large":[54],"networks,":[55],"can":[56],"result":[57],"in":[58],"substantial":[60],"reduction":[61],"computation":[63],"over":[64],"standard":[66],"programming":[68],"approach.":[69]},"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":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}