{"id":"https://openalex.org/W2010997912","doi":"https://doi.org/10.1057/jors.1978.105","title":"Linear Programming and Network Flows","display_name":"Linear Programming and Network Flows","alternate_titles":[],"publication_year":1978,"publication_date":"1978-05-01","ids":{"openalex":"https://openalex.org/W2010997912","doi":"https://doi.org/10.1057/jors.1978.105","mag":"2010997912"},"language":"en","primary_location":{"id":"doi:10.1057/jors.1978.105","doi":"https://doi.org/10.1057/jors.1978.105","is_oa":false,"landing_page_url":"https://doi.org/10.1057/jors.1978.105","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a","anvur-class-a","anvur-scientific","cwts-core","erih-plus","fnege-2","jufo-2","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W2010997912"],"child_works_count":0,"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/A5087502764","display_name":"C. R. Sergeant","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"C. R. Sergeant","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020017378","display_name":"Mokhtar S. Bazaraa","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Mokhtar S. Bazaraa","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5038540879","display_name":"John J. Jarvis","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"John J. Jarvis","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":9.1077,"has_fulltext":false,"cited_by_count":1972,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.9872989,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":"29","issue":"5","first_page":"510","last_page":"510"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9595000147819519,"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.9595000147819519,"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.03579999879002571,"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":0.004100000020116568,"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/linear-programming","display_name":"linear programming","score":0.9990000128746033},{"id":"https://openalex.org/keywords/network-flow","display_name":"network flow","score":0.9810000061988831},{"id":"https://openalex.org/keywords/simplex-method","display_name":"simplex method","score":0.9929999709129333},{"id":"https://openalex.org/keywords/duality","display_name":"duality","score":0.7710000276565552},{"id":"https://openalex.org/keywords/sensitivity-analysis","display_name":"sensitivity analysis","score":0.9990000128746033},{"id":"https://openalex.org/keywords/decomposition-principle","display_name":"decomposition principle","score":0.7360000014305115},{"id":"https://openalex.org/keywords/computational-complexity","display_name":"computational complexity","score":0.6949999928474426},{"id":"https://openalex.org/keywords/transportation-problem","display_name":"transportation problem","score":0.9950000047683716},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"assignment problem","score":1.0},{"id":"https://openalex.org/keywords/out-of-kilter-algorithm","display_name":"out-of-kilter algorithm","score":0.9959999918937683},{"id":"https://openalex.org/keywords/maximum-flow","display_name":"maximum flow","score":0.8989999890327454},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.9480000138282776},{"id":"https://openalex.org/keywords/multi-commodity-flow","display_name":"multicommodity flow","score":0.9900000095367432},{"id":"https://openalex.org/keywords/network-synthesis","display_name":"network synthesis","score":0.7900000214576721},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"convex analysis","score":0.8690000176429749},{"id":"https://openalex.org/keywords/polyhedral-sets","display_name":"polyhedral sets","score":0.9900000095367432}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5374115109443665},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5224465727806091},{"id":"https://openalex.org/C15952604","wikidata":"https://www.wikidata.org/wiki/Q179012","display_name":"Project management","level":2,"score":0.5222019553184509},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.4836329221725464},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.20273128151893616},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19536417722702026},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.13740095496177673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11659848690032959}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1057/jors.1978.105","doi":"https://doi.org/10.1057/jors.1978.105","is_oa":false,"landing_page_url":"https://doi.org/10.1057/jors.1978.105","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a","anvur-class-a","anvur-scientific","cwts-core","erih-plus","fnege-2","jufo-2","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"doi:10.2307/3009778","doi":"https://doi.org/10.2307/3009778","is_oa":false,"landing_page_url":"https://doi.org/10.2307/3009778","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["abdc-a","anvur-class-a","anvur-scientific","cwts-core","erih-plus","fnege-2","jufo-2","norway-1","poland-70","russia-white-list-1","vabb-shw"],"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Journal of the Operational Research Society","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":0,"referenced_works":[],"related_works":["https://openalex.org/W2044973895","https://openalex.org/W4245280747","https://openalex.org/W2140814799","https://openalex.org/W1981806531","https://openalex.org/W4256316039","https://openalex.org/W2758424441","https://openalex.org/W44120650","https://openalex.org/W2059785532","https://openalex.org/W2059639915","https://openalex.org/W1585591997"],"abstract_inverted_index":{"One:":[0],"Introduction.Two:":[1],"Linear":[2],"Algebra,":[3],"Convex":[4],"Analysis,":[5],"and":[6,14,19,23,39,51],"Polyhedral":[7],"Sets.Three:":[8],"The":[9,26,37,42],"Simplex":[10,17,32],"Method.Four:":[11],"Starting":[12],"Solution":[13],"Convergence.Five:":[15],"Special":[16],"Implementations":[18],"Optimality":[20],"Conditions.Six:":[21],"Duality":[22],"Sensitivity":[24],"Analysis.Seven:":[25],"Decomposition":[27],"Principle.Eight:":[28],"Complexity":[29],"of":[30],"the":[31],"Algorithms.Nine:":[33],"Minimal-Cost":[34],"Network":[35,52],"Flows.Ten:":[36],"Transportation":[38],"Assignment":[40],"Problems.Eleven:":[41],"Out-of-Kilter":[43],"Algorithm.Twelve:":[44],"Maximal":[45],"Flow,":[46,50],"Shortest":[47],"Path,":[48],"Multicommodity":[49],"Synthesis":[53],"Problems.Bibliography.Index.":[54]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2010997912","counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":35},{"year":2020,"cited_by_count":51},{"year":2019,"cited_by_count":57},{"year":2018,"cited_by_count":72},{"year":2017,"cited_by_count":49},{"year":2016,"cited_by_count":59},{"year":2015,"cited_by_count":103},{"year":2014,"cited_by_count":104},{"year":2013,"cited_by_count":124},{"year":2012,"cited_by_count":99}],"updated_date":"2026-11-20T13:11:24.684918","created_date":"2016-06-24T00:00:00"}
