{"id":"https://openalex.org/W2139805900","doi":"https://doi.org/10.1287/opre.14.4.619","title":"Networks and Basic Solutions","display_name":"Networks and Basic Solutions","publication_year":1966,"publication_date":"1966-08-01","ids":{"openalex":"https://openalex.org/W2139805900","doi":"https://doi.org/10.1287/opre.14.4.619","mag":"2139805900"},"language":"en","primary_location":{"id":"doi:10.1287/opre.14.4.619","doi":"https://doi.org/10.1287/opre.14.4.619","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.14.4.619","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a-star","anvur-class-a","anvur-scientific","cwts-core","fnege-1-star","ft50","jufo-3","norway-2","poland-140","russia-white-list-1","utd24","vabb-shw"],"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5109938494","display_name":"Ellis L. Johnson","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ellis L. Johnson","raw_affiliation_strings":["Yale University, New Haven, Connecticut"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Yale University, New Haven, Connecticut","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5109938494"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":0.5006,"has_fulltext":false,"cited_by_count":121,"citation_normalized_percentile":{"value":0.54757785,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":"14","issue":"4","first_page":"619","last_page":"623"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.0019000000320374966,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":9.999999747378752e-05,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/network-flow-problems","display_name":"network flow problems","score":0.890999972820282},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"simplex algorithm","score":0.7300000190734863},{"id":"https://openalex.org/keywords/maximum-flow","display_name":"maximum flow","score":0.9010000228881836},{"id":"https://openalex.org/keywords/ford-fulkerson-algorithm","display_name":"Ford-Fulkerson algorithm","score":0.996999979019165},{"id":"https://openalex.org/keywords/alkaline-media","display_name":"alkaline solution","score":0.9269999861717224}],"concepts":[{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.7465999126434326},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.726012647151947},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.6504594087600708},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.643683910369873},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.637047290802002},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.6165523529052734},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6114524602890015},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.5659105181694031},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.5601445436477661},{"id":"https://openalex.org/C2776299755","wikidata":"https://www.wikidata.org/wiki/Q432449","display_name":"Carry (investment)","level":2,"score":0.5384924411773682},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.5155272483825684},{"id":"https://openalex.org/C133824558","wikidata":"https://www.wikidata.org/wiki/Q16893660","display_name":"Out-of-kilter algorithm","level":5,"score":0.47973886132240295},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44689542055130005},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.34594789147377014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3055492043495178},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11439293622970581},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10390850901603699},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08070144057273865},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.0},{"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/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"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/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.1287/opre.14.4.619","doi":"https://doi.org/10.1287/opre.14.4.619","is_oa":false,"landing_page_url":"https://doi.org/10.1287/opre.14.4.619","pdf_url":null,"source":{"id":"https://openalex.org/S125775545","display_name":"Operations Research","issn_l":"0030-364X","issn":["0030-364X","1526-5463"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a-star","anvur-class-a","anvur-scientific","cwts-core","fnege-1-star","ft50","jufo-3","norway-2","poland-140","russia-white-list-1","utd24","vabb-shw"],"host_organization":"https://openalex.org/P4310315699","host_organization_name":"Institute for Operations Research and the Management Sciences","host_organization_lineage":["https://openalex.org/P4310315699"],"host_organization_lineage_names":["Institute for Operations Research and the Management Sciences"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1964119857","https://openalex.org/W2059608229","https://openalex.org/W2127470768","https://openalex.org/W2327315803"],"related_works":["https://openalex.org/W2108941818","https://openalex.org/W7110520398","https://openalex.org/W2963592990","https://openalex.org/W1990337640","https://openalex.org/W2349802111","https://openalex.org/W2088323539","https://openalex.org/W2184905124","https://openalex.org/W2731053115","https://openalex.org/W2386941597","https://openalex.org/W7096834032"],"abstract_inverted_index":{"A":[0,23,52],"labeling":[1,84],"procedure":[2,53,85],"which":[3,36,81],"could":[4],"be":[5],"used":[6],"to":[7,39,54,89,106],"carry":[8],"out":[9],"the":[10,13,26,30,40,44,50,56,60,82,94,102],"steps":[11],"of":[12,25,67,101],"simplex":[14,27],"algorithm":[15,28,42,62],"for":[16,29,80],"a":[17,68],"network":[18,103],"flow":[19,32,69,104],"problem":[20,33,72],"is":[21,34,37,63,78,110],"given.":[22,64],"modification":[24],"maximum":[31],"suggested":[35],"equivalent":[38],"Ford-Fulkerson":[41,61],"if":[43,93],"solutions":[45,57,95],"are":[46,96],"kept":[47,98],"basic":[48,58],"in":[49,59],"latter.":[51],"keep":[55],"An":[65],"example":[66],"with":[70,73,108],"gains":[71,77,109],"integer":[74],"capacities":[75],"and":[76],"given":[79],"usual":[83],"may":[86],"not":[87,97],"lead":[88],"an":[90],"optimum":[91],"solution":[92],"basic.":[99],"Extension":[100],"techniques":[105],"flows":[107],"discussed.":[111]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-10-01T08:54:57.152042","created_date":"2016-06-24T00:00:00"}