{"id":"https://openalex.org/W2107723815","doi":"https://doi.org/10.1109/cvpr.2008.4587355","title":"High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF)","display_name":"High-arity interactions, polyhedral relaxations, and cutting plane algorithm for soft constraint optimisation (MAP-MRF)","publication_year":2008,"publication_date":"2008-06-01","ids":{"openalex":"https://openalex.org/W2107723815","doi":"https://doi.org/10.1109/cvpr.2008.4587355","mag":"2107723815"},"language":"en","primary_location":{"id":"doi:10.1109/cvpr.2008.4587355","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2008.4587355","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Conference on Computer Vision and Pattern Recognition","raw_type":"proceedings-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/A5020537156","display_name":"Tom\u00e1\u0161 Werner","orcid":"https://orcid.org/0000-0002-6161-7157"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Tomas Werner","raw_affiliation_strings":["Center for Machine Perception, Department of Cybernetics, Czech Technical University, Praque, Czech Republic","Dept. of Cybern., Czech Tech. Univ., Prague"],"affiliations":[{"raw_affiliation_string":"Center for Machine Perception, Department of Cybernetics, Czech Technical University, Praque, Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"Dept. of Cybern., Czech Tech. Univ., Prague","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020537156"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":15.7915,"has_fulltext":false,"cited_by_count":92,"citation_normalized_percentile":{"value":0.99187533,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.998199999332428,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.998199999332428,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9593999981880188,"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/T11063","display_name":"Rough Sets and Fuzzy Logic","score":0.9488999843597412,"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/arity","display_name":"Arity","score":0.9582545757293701},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.6797492504119873},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6590192914009094},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5523451566696167},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5288345217704773},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5217624306678772},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.5011608600616455},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.49881982803344727},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4693965017795563},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.457818865776062},{"id":"https://openalex.org/keywords/constraint-satisfaction","display_name":"Constraint satisfaction","score":0.448516845703125},{"id":"https://openalex.org/keywords/cutting-plane-method","display_name":"Cutting-plane method","score":0.4221170246601105},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3858353793621063},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09287962317466736},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.08500039577484131}],"concepts":[{"id":"https://openalex.org/C110546421","wikidata":"https://www.wikidata.org/wiki/Q1315869","display_name":"Arity","level":2,"score":0.9582545757293701},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.6797492504119873},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6590192914009094},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5523451566696167},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5288345217704773},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5217624306678772},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5011608600616455},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.49881982803344727},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4693965017795563},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.457818865776062},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.448516845703125},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.4221170246601105},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3858353793621063},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09287962317466736},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.08500039577484131},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cvpr.2008.4587355","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cvpr.2008.4587355","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Conference on Computer Vision and Pattern Recognition","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W7070610","https://openalex.org/W10769007","https://openalex.org/W25884984","https://openalex.org/W389907844","https://openalex.org/W1521783990","https://openalex.org/W1595648220","https://openalex.org/W1839939441","https://openalex.org/W2005103485","https://openalex.org/W2006293258","https://openalex.org/W2016639451","https://openalex.org/W2035575256","https://openalex.org/W2108619558","https://openalex.org/W2135414191","https://openalex.org/W2140789035","https://openalex.org/W2144306116","https://openalex.org/W2150675045","https://openalex.org/W2157244733","https://openalex.org/W2158907148","https://openalex.org/W2164918853","https://openalex.org/W2504244491","https://openalex.org/W2913256821","https://openalex.org/W4233536073","https://openalex.org/W4285719527","https://openalex.org/W6600410068","https://openalex.org/W6682199522","https://openalex.org/W7015796718"],"related_works":["https://openalex.org/W3021221643","https://openalex.org/W2155910042","https://openalex.org/W3184046060","https://openalex.org/W3061362066","https://openalex.org/W2626872748","https://openalex.org/W1492779419","https://openalex.org/W2161128834","https://openalex.org/W70192758","https://openalex.org/W4298364136","https://openalex.org/W1949981435"],"abstract_inverted_index":{"LP":[0,31],"relaxation":[1],"approach":[2],"to":[3,21,28,65,73],"soft":[4],"constraint":[5,77],"optimisation":[6],"(i.e.":[7],"MAP-MRF)":[8],"has":[9],"been":[10],"mostly":[11],"considered":[12],"only":[13],"for":[14,111],"binary":[15],"problems.":[16,114],"We":[17,56],"present":[18],"its":[19],"generalisation":[20],"n-ary":[22,33,105,112],"problems,":[23],"including":[24],"a":[25,41,58,98],"simple":[26],"algorithm":[27],"optimise":[29],"the":[30,70,95],"bound,":[32],"max-sum":[34,106],"diffusion.":[35],"As":[36],"applications,":[37],"we":[38,81,102],"show":[39,82],"that":[40,83,104],"hierarchy":[42],"of":[43,48],"gradually":[44],"tighter":[45],"polyhedral":[46],"relaxations":[47],"MAP-MRF":[49],"is":[50],"obtained":[51],"by":[52],"adding":[53,66],"zero":[54,67],"interactions.":[55],"propose":[57],"cutting":[59],"plane":[60],"algorithm,":[61],"where":[62],"cuts":[63],"correspond":[64],"interactions":[68],"and":[69],"separation":[71],"problem":[72],"finding":[74],"an":[75],"unsatisfiable":[76],"satisfaction":[78],"subproblem.":[79],"Next,":[80],"certain":[84,88],"high-arity":[85],"interactions,":[86],"e.g.":[87],"global":[89,109],"constraints,":[90],"can":[91],"be":[92],"included":[93],"into":[94],"framework":[96],"in":[97],"principled":[99],"way.":[100],"Finally,":[101],"prove":[103],"diffusion":[107],"finds":[108],"optimum":[110],"supermodular":[113]},"counts_by_year":[{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":13}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}