{"id":"https://openalex.org/W1986525787","doi":"https://doi.org/10.1007/s10878-005-1777-9","title":"The 2-Edge-Connected Subgraph Polyhedron","display_name":"The 2-Edge-Connected Subgraph Polyhedron","publication_year":2005,"publication_date":"2005-06-01","ids":{"openalex":"https://openalex.org/W1986525787","doi":"https://doi.org/10.1007/s10878-005-1777-9","mag":"1986525787"},"language":"en","primary_location":{"id":"doi:10.1007/s10878-005-1777-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-005-1777-9","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","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/A5033009395","display_name":"Dieter Vandenbussche","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Dieter Vandenbussche","raw_affiliation_strings":["Department of Mechanical and Industrial Engineering, University of Illinois Urbana-Champaign, Urbana-Champaign","Department of Mechanical and Industrial Engineering, University of Illinois Urbana-Champaign, Urbana-Champaign,"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Industrial Engineering, University of Illinois Urbana-Champaign, Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Mechanical and Industrial Engineering, University of Illinois Urbana-Champaign, Urbana-Champaign,","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057281816","display_name":"George L. Nemhauser","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"George L. Nemhauser","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology, USA"],"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033009395"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":null,"fwci":0.6743,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.69853262,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"9","issue":"4","first_page":"357","last_page":"379"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9921000003814697,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/polyhedron","display_name":"Polyhedron","score":0.8827296495437622},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.705919086933136},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6911206245422363},{"id":"https://openalex.org/keywords/dual-polyhedron","display_name":"Dual polyhedron","score":0.6139107942581177},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5879290103912354},{"id":"https://openalex.org/keywords/vertex-connectivity","display_name":"Vertex connectivity","score":0.5507616996765137},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.5399892330169678},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5395334362983704},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49876856803894043},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4706631898880005},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.4125932455062866},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3341980576515198},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.32175570726394653},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.22757893800735474},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1659453809261322},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08757948875427246}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.8827296495437622},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.705919086933136},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6911206245422363},{"id":"https://openalex.org/C105313907","wikidata":"https://www.wikidata.org/wiki/Q1053857","display_name":"Dual polyhedron","level":2,"score":0.6139107942581177},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5879290103912354},{"id":"https://openalex.org/C2983226441","wikidata":"https://www.wikidata.org/wiki/Q3115621","display_name":"Vertex connectivity","level":4,"score":0.5507616996765137},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.5399892330169678},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5395334362983704},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49876856803894043},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4706631898880005},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.4125932455062866},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3341980576515198},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.32175570726394653},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.22757893800735474},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1659453809261322},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08757948875427246},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s10878-005-1777-9","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s10878-005-1777-9","pdf_url":null,"source":{"id":"https://openalex.org/S107925523","display_name":"Journal of Combinatorial Optimization","issn_l":"1382-6905","issn":["1382-6905","1573-2886"],"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":"Journal of Combinatorial Optimization","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:jcomop:v:9:y:2005:i:4:d:10.1007_s10878-005-1777-9","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10878-005-1777-9","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1541536235","https://openalex.org/W1652378708","https://openalex.org/W1964127155","https://openalex.org/W1977889042","https://openalex.org/W1981894795","https://openalex.org/W1997949329","https://openalex.org/W2033662447","https://openalex.org/W2046469316","https://openalex.org/W2049591070","https://openalex.org/W2050851587","https://openalex.org/W2053902064","https://openalex.org/W2056058917","https://openalex.org/W2067684024","https://openalex.org/W2083210138","https://openalex.org/W2089731376","https://openalex.org/W2112715082","https://openalex.org/W2123324452","https://openalex.org/W2128053745","https://openalex.org/W2161305900"],"related_works":["https://openalex.org/W2536013957","https://openalex.org/W2184834902","https://openalex.org/W2183097989","https://openalex.org/W2241463327","https://openalex.org/W2038458261","https://openalex.org/W2105006450","https://openalex.org/W1579502333","https://openalex.org/W2044119054","https://openalex.org/W2950140349","https://openalex.org/W1752817158"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}