{"id":"https://openalex.org/W52549856","doi":"https://doi.org/10.1007/978-1-4612-1009-2_8","title":"Network-Flow Problems","display_name":"Network-Flow Problems","alternate_titles":[],"publication_year":1989,"publication_date":"1989-01-01","ids":{"openalex":"https://openalex.org/W52549856","doi":"https://doi.org/10.1007/978-1-4612-1009-2_8","mag":"52549856"},"language":"en","primary_location":{"id":"doi:10.1007/978-1-4612-1009-2_8","doi":"https://doi.org/10.1007/978-1-4612-1009-2_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4612-1009-2_8","pdf_url":null,"source":{"id":"https://openalex.org/S4210218630","display_name":"Undergraduate texts in mathematics","issn_l":"0172-6056","issn":["0172-6056","2197-5604"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Undergraduate Texts in Mathematics","raw_type":"book-chapter"},"parent_works":[{"id":"https://openalex.org/W607624269","display_name":"Linear Programming and Its Applications","relationship":"volume"}],"lineage":["https://openalex.org/W52549856","https://openalex.org/W607624269"],"child_works_count":0,"type":"book-chapter","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/A5005777175","display_name":"James K. Strayer","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I63329203","display_name":"Lock Haven University","ror":"https://ror.org/046aym564","country_code":"US","type":"education","lineage":["https://openalex.org/I63329203"]}],"countries":["US"],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"James K. Strayer","raw_affiliation_strings":["Department of Mathematics, Lock Haven University, Lock Haven, PA, 17745, USA","Lock Haven University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Lock Haven University, Lock Haven, PA, 17745, USA","institution_ids":["https://openalex.org/I63329203"]},{"raw_affiliation_string":"Lock Haven University","institution_ids":["https://openalex.org/I63329203"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005777175"],"corresponding_institution_ids":["https://openalex.org/I63329203"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"185","last_page":"237"},"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.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.0015999999595806003,"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.0,"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.8939999938011169},{"id":"https://openalex.org/keywords/linear-programming","display_name":"linear programming","score":0.6639999747276306},{"id":"https://openalex.org/keywords/graph-algorithms","display_name":"graph algorithms","score":0.6359999775886536},{"id":"https://openalex.org/keywords/duality-theory","display_name":"duality theory","score":0.8579999804496765},{"id":"https://openalex.org/keywords/transportation-problem","display_name":"transportation problem","score":0.9620000123977661},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"assignment problem","score":0.9869999885559082},{"id":"https://openalex.org/keywords/flow-networks","display_name":"flow networks","score":0.503000020980835}],"concepts":[{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.7638620138168335},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5885617136955261},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5542638301849365},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5440950989723206},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4991021156311035},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4865495264530182},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.4838653802871704},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.4764825999736786},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4727747440338135},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.45941266417503357},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4452539086341858},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4396218955516815},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3652636408805847},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.14536643028259277},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08501577377319336},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08419740200042725},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-1-4612-1009-2_8","doi":"https://doi.org/10.1007/978-1-4612-1009-2_8","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-1-4612-1009-2_8","pdf_url":null,"source":{"id":"https://openalex.org/S4210218630","display_name":"Undergraduate texts in mathematics","issn_l":"0172-6056","issn":["0172-6056","2197-5604"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Undergraduate Texts in Mathematics","raw_type":"book-chapter"}],"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/W2484513825","https://openalex.org/W2485704337","https://openalex.org/W2520749787","https://openalex.org/W2758424441","https://openalex.org/W236113486","https://openalex.org/W279448582","https://openalex.org/W4256316039","https://openalex.org/W4249359625","https://openalex.org/W97189815","https://openalex.org/W201131573"],"abstract_inverted_index":null,"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W52549856","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
