{"id":"https://openalex.org/W2044153429","doi":"https://doi.org/10.1007/bf01582058","title":"Efficient enumeration of the vertices of polyhedra associated with network LP's","display_name":"Efficient enumeration of the vertices of polyhedra associated with network LP's","publication_year":1994,"publication_date":"1994-01-01","ids":{"openalex":"https://openalex.org/W2044153429","doi":"https://doi.org/10.1007/bf01582058","mag":"2044153429"},"language":"en","primary_location":{"id":"doi:10.1007/bf01582058","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01582058","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/A5005781105","display_name":"J. Scott Provan","orcid":null},"institutions":[{"id":"https://openalex.org/I114027177","display_name":"University of North Carolina at Chapel Hill","ror":"https://ror.org/0130frc33","country_code":"US","type":"education","lineage":["https://openalex.org/I114027177"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"J. Scott Provan","raw_affiliation_strings":["Department of Operations Research, University of North Carolina, 27599-3180, Chapel Hill, NC, USA","Department of Operations Research, University of North Carolina, Chapel Hill, USA"],"affiliations":[{"raw_affiliation_string":"Department of Operations Research, University of North Carolina, 27599-3180, Chapel Hill, NC, USA","institution_ids":["https://openalex.org/I114027177"]},{"raw_affiliation_string":"Department of Operations Research, University of North Carolina, Chapel Hill, USA","institution_ids":["https://openalex.org/I114027177"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005781105"],"corresponding_institution_ids":["https://openalex.org/I114027177"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":1.6156,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.84951758,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"63","issue":"1-3","first_page":"47","last_page":"64"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/dual-polyhedron","display_name":"Dual polyhedron","score":0.9223307371139526},{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.9067118167877197},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.740618884563446},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7085750102996826},{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.5629974007606506},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.45085564255714417},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4365875720977783},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4139217436313629},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21891438961029053}],"concepts":[{"id":"https://openalex.org/C105313907","wikidata":"https://www.wikidata.org/wiki/Q1053857","display_name":"Dual polyhedron","level":2,"score":0.9223307371139526},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.9067118167877197},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.740618884563446},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7085750102996826},{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.5629974007606506},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.45085564255714417},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4365875720977783},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4139217436313629},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21891438961029053},{"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/bf01582058","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01582058","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/W27269047","https://openalex.org/W233935999","https://openalex.org/W587622775","https://openalex.org/W1655990431","https://openalex.org/W1983281982","https://openalex.org/W1991287453","https://openalex.org/W2009162210","https://openalex.org/W2010997912","https://openalex.org/W2011562113","https://openalex.org/W2030334004","https://openalex.org/W2056996623","https://openalex.org/W2061344951","https://openalex.org/W2071094669","https://openalex.org/W2079789648","https://openalex.org/W2125690626","https://openalex.org/W2151882889","https://openalex.org/W2156393948","https://openalex.org/W2492353954","https://openalex.org/W2562438202","https://openalex.org/W2767970464","https://openalex.org/W2795674018","https://openalex.org/W6659881592","https://openalex.org/W6670141119","https://openalex.org/W6723406818"],"related_works":["https://openalex.org/W2008231869","https://openalex.org/W2090263210","https://openalex.org/W2949692952","https://openalex.org/W2197678707","https://openalex.org/W1995855104","https://openalex.org/W2900515541","https://openalex.org/W2254121517","https://openalex.org/W2090864852","https://openalex.org/W2497378183","https://openalex.org/W2067082491"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}