{"id":"https://openalex.org/W2750208231","doi":"https://doi.org/10.1007/978-3-319-89920-6_42","title":"A Hypergraph Network Simplex Algorithm","display_name":"A Hypergraph Network Simplex Algorithm","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2750208231","doi":"https://doi.org/10.1007/978-3-319-89920-6_42","mag":"2750208231"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-89920-6_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-89920-6_42","pdf_url":null,"source":{"id":"https://openalex.org/S4210184104","display_name":"Operations research proceedings","issn_l":"0721-5924","issn":["0721-5924","2197-9294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Proceedings","raw_type":"book-chapter"},"type":"book-chapter","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/A5041780174","display_name":"Isabel Beckenbach","orcid":"https://orcid.org/0000-0001-6691-7362"},"institutions":[{"id":"https://openalex.org/I195893171","display_name":"Zuse Institute Berlin","ror":"https://ror.org/02eva5865","country_code":"DE","type":"facility","lineage":["https://openalex.org/I195893171"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Isabel Beckenbach","raw_affiliation_strings":["Zuse Institute Berlin, Takustr. 7, 14195, Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Zuse Institute Berlin, Takustr. 7, 14195, Berlin, Germany","institution_ids":["https://openalex.org/I195893171"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5041780174"],"corresponding_institution_ids":["https://openalex.org/I195893171"],"apc_list":null,"apc_paid":null,"fwci":5.7217,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.94239874,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"309","last_page":"315"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9984999895095825,"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.9984999895095825,"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/T11106","display_name":"Data Management and Algorithms","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9905999898910522,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"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/simplex-algorithm","display_name":"Simplex algorithm","score":0.7460721135139465},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.7171022295951843},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.6784877777099609},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.5567262768745422},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.5055763721466064},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4952365458011627},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48290038108825684},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.475159615278244},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4502163231372833},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.42811501026153564},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4266486167907715},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38307905197143555},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3546932339668274},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3473140001296997}],"concepts":[{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.7460721135139465},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.7171022295951843},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.6784877777099609},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.5567262768745422},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.5055763721466064},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4952365458011627},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48290038108825684},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.475159615278244},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4502163231372833},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.42811501026153564},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4266486167907715},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38307905197143555},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3546932339668274},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3473140001296997},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-89920-6_42","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-89920-6_42","pdf_url":null,"source":{"id":"https://openalex.org/S4210184104","display_name":"Operations research proceedings","issn_l":"0721-5924","issn":["0721-5924","2197-9294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319965","host_organization_name":"Springer Nature","host_organization_lineage":["https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Operations Research Proceedings","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":5,"referenced_works":["https://openalex.org/W1544523010","https://openalex.org/W1970516489","https://openalex.org/W2060416492","https://openalex.org/W2112660220","https://openalex.org/W2168629004"],"related_works":["https://openalex.org/W2375873432","https://openalex.org/W4206915070","https://openalex.org/W2531764854","https://openalex.org/W2098682899","https://openalex.org/W3161514703","https://openalex.org/W2141299097","https://openalex.org/W1851375266","https://openalex.org/W2610002854","https://openalex.org/W2625547693","https://openalex.org/W2011545080"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}