{"id":"https://openalex.org/W1791220908","doi":"https://doi.org/10.1007/978-3-540-72397-4_20","title":"The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width","display_name":"The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W1791220908","doi":"https://doi.org/10.1007/978-3-540-72397-4_20","mag":"1791220908"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-72397-4_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-72397-4_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5045749522","display_name":"Meinolf Sellmann","orcid":"https://orcid.org/0000-0002-4513-8180"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Meinolf Sellmann","raw_affiliation_strings":["Brown University, Department of Computer Science, 115 Waterman Street, P.O. Box 1910, Providence, RI 02912,","Brown University, Department of Computer Science, 115 Waterman Street, P.O. Box 1910, Providence, RI 02912,#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brown University, Department of Computer Science, 115 Waterman Street, P.O. Box 1910, Providence, RI 02912,","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Brown University, Department of Computer Science, 115 Waterman Street, P.O. Box 1910, Providence, RI 02912,#TAB#","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074418647","display_name":"Luc Mercier","orcid":"https://orcid.org/0000-0002-5866-2547"},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Luc Mercier","raw_affiliation_strings":["Brown University, Department of Computer Science, 115 Waterman Street, P.O. Box 1910, Providence, RI 02912,","Brown University, Department of Computer Science, 115 Waterman Street, P.O. Box 1910, Providence, RI 02912,#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brown University, Department of Computer Science, 115 Waterman Street, P.O. Box 1910, Providence, RI 02912,","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Brown University, Department of Computer Science, 115 Waterman Street, P.O. Box 1910, Providence, RI 02912,#TAB#","institution_ids":["https://openalex.org/I27804330"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064650131","display_name":"Daniel H. Leventhal","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel H. Leventhal","raw_affiliation_strings":["Brown University, Department of Computer Science, 115 Waterman Street, P.O. Box 1910, Providence, RI 02912,","Brown University, Department of Computer Science, 115 Waterman Street, P.O. Box 1910, Providence, RI 02912,#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brown University, Department of Computer Science, 115 Waterman Street, P.O. Box 1910, Providence, RI 02912,","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Brown University, Department of Computer Science, 115 Waterman Street, P.O. Box 1910, Providence, RI 02912,#TAB#","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045749522","https://openalex.org/A5074418647"],"corresponding_institution_ids":["https://openalex.org/I27804330"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.8227,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.67244398,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"275","last_page":"287"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994000196456909,"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.9994000196456909,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9991999864578247,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9860000014305115,"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/bounded-function","display_name":"Bounded function","score":0.7446956634521484},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.6777352690696716},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.6366573572158813},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.5713322162628174},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5503531694412231},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5245335698127747},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5167967081069946},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4888853132724762},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47355973720550537},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.46037134528160095},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4276588559150696},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.42478129267692566},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4168321192264557},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.41023126244544983},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37968674302101135},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36600226163864136},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35656964778900146},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27007901668548584},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.05742481350898743}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7446956634521484},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.6777352690696716},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.6366573572158813},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.5713322162628174},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5503531694412231},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5245335698127747},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5167967081069946},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4888853132724762},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47355973720550537},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.46037134528160095},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4276588559150696},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.42478129267692566},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4168321192264557},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.41023126244544983},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37968674302101135},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36600226163864136},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35656964778900146},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27007901668548584},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.05742481350898743},{"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/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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":3,"locations":[{"id":"doi:10.1007/978-3-540-72397-4_20","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-72397-4_20","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.83.6893","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.83.6893","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.brown.edu/~sello/PAPER/cpaior07.pdf","raw_type":"text"},{"id":"pmh:oai:dial.uclouvain.be:boreal:67863","is_oa":false,"landing_page_url":"http://hdl.handle.net/2078.1/67863","pdf_url":null,"source":{"id":"https://openalex.org/S4306401902","display_name":"Digital Access to Libraries (Universit\u00e9 catholique de Louvain (UCL), l'Universit\u00e9 de Namur (UNamur) and the Universit\u00e9 Saint-Louis (USL-B))","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I95674353","host_organization_name":"UCLouvain","host_organization_lineage":["https://openalex.org/I95674353"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W99828349","https://openalex.org/W1508891358","https://openalex.org/W1515956190","https://openalex.org/W1550483759","https://openalex.org/W1561555658","https://openalex.org/W1573298811","https://openalex.org/W1577871565","https://openalex.org/W1968143987","https://openalex.org/W1999038767","https://openalex.org/W2029448190","https://openalex.org/W2049143039","https://openalex.org/W2059372025","https://openalex.org/W2065139435","https://openalex.org/W2067633747","https://openalex.org/W2076535438","https://openalex.org/W2080394239","https://openalex.org/W2091565303","https://openalex.org/W2151028272","https://openalex.org/W2338905098","https://openalex.org/W2505968561","https://openalex.org/W4300005617"],"related_works":["https://openalex.org/W4280529077","https://openalex.org/W1493684871","https://openalex.org/W2886567582","https://openalex.org/W4390962314","https://openalex.org/W4289703404","https://openalex.org/W2999175164","https://openalex.org/W4387265813","https://openalex.org/W2532883656","https://openalex.org/W2593735092","https://openalex.org/W2749663619"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}