{"id":"https://openalex.org/W2009162210","doi":"https://doi.org/10.1007/bf01593771","title":"An algorithm for determining all extreme points of a convex polytope","display_name":"An algorithm for determining all extreme points of a convex polytope","publication_year":1977,"publication_date":"1977-12-01","ids":{"openalex":"https://openalex.org/W2009162210","doi":"https://doi.org/10.1007/bf01593771","mag":"2009162210"},"language":"en","primary_location":{"id":"doi:10.1007/bf01593771","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01593771","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","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/A5019297501","display_name":"Martin Dyer","orcid":"https://orcid.org/0000-0002-2018-0374"},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"M. E. Dyer","raw_affiliation_strings":["University of Leeds, Leeds, UK"],"affiliations":[{"raw_affiliation_string":"University of Leeds, Leeds, UK","institution_ids":["https://openalex.org/I130828816"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079400922","display_name":"L. G. Proll","orcid":null},"institutions":[{"id":"https://openalex.org/I130828816","display_name":"University of Leeds","ror":"https://ror.org/024mrxd33","country_code":"GB","type":"education","lineage":["https://openalex.org/I130828816"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"L. G. Proll","raw_affiliation_strings":["University of Leeds, Leeds, UK"],"affiliations":[{"raw_affiliation_string":"University of Leeds, Leeds, UK","institution_ids":["https://openalex.org/I130828816"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019297501"],"corresponding_institution_ids":["https://openalex.org/I130828816"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.4031,"has_fulltext":false,"cited_by_count":100,"citation_normalized_percentile":{"value":0.93557536,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"12","issue":"1","first_page":"81","last_page":"96"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9986000061035156,"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.9986000061035156,"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.9952999949455261,"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/T14304","display_name":"Transport Systems and Technology","score":0.947700023651123,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/extreme-point","display_name":"Extreme point","score":0.8165093660354614},{"id":"https://openalex.org/keywords/simplex-algorithm","display_name":"Simplex algorithm","score":0.8043739795684814},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.7425943613052368},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.6899893879890442},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6604936718940735},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5817164182662964},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.577811062335968},{"id":"https://openalex.org/keywords/simplex","display_name":"Simplex","score":0.5654065608978271},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5490028858184814},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.5289796590805054},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.527540922164917},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.506213366985321},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.43641889095306396},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.42363011837005615},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42086201906204224},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.3936813771724701},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3109859228134155},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.28661537170410156},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.2662864923477173},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2382056713104248}],"concepts":[{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.8165093660354614},{"id":"https://openalex.org/C144521790","wikidata":"https://www.wikidata.org/wiki/Q134164","display_name":"Simplex algorithm","level":3,"score":0.8043739795684814},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.7425943613052368},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.6899893879890442},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6604936718940735},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5817164182662964},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.577811062335968},{"id":"https://openalex.org/C62438384","wikidata":"https://www.wikidata.org/wiki/Q331350","display_name":"Simplex","level":2,"score":0.5654065608978271},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5490028858184814},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.5289796590805054},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.527540922164917},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.506213366985321},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.43641889095306396},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.42363011837005615},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42086201906204224},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.3936813771724701},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3109859228134155},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.28661537170410156},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.2662864923477173},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2382056713104248},{"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/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/bf01593771","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01593771","pdf_url":null,"source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1945881016","https://openalex.org/W1969248094","https://openalex.org/W1999667176","https://openalex.org/W2011087880","https://openalex.org/W2011562113","https://openalex.org/W2038958829","https://openalex.org/W2049536263","https://openalex.org/W2056996623","https://openalex.org/W2071094669","https://openalex.org/W2071727445","https://openalex.org/W2081041113","https://openalex.org/W2099408765","https://openalex.org/W2151882889","https://openalex.org/W2168276108","https://openalex.org/W2492353954","https://openalex.org/W2752853835","https://openalex.org/W2800137643","https://openalex.org/W3016074254","https://openalex.org/W3021014091","https://openalex.org/W3022177319","https://openalex.org/W4231139853","https://openalex.org/W4235009102","https://openalex.org/W4285719527","https://openalex.org/W6723406818"],"related_works":["https://openalex.org/W2385011829","https://openalex.org/W2133667137","https://openalex.org/W2017494791","https://openalex.org/W187881786","https://openalex.org/W1972615387","https://openalex.org/W2293098548","https://openalex.org/W1530516972","https://openalex.org/W41227520","https://openalex.org/W2009162210","https://openalex.org/W3777771"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}