{"id":"https://openalex.org/W3083066198","doi":"https://doi.org/10.1007/978-3-030-58475-7_11","title":"Bounding Linear Programs by Constraint Propagation: Application to Max-SAT","display_name":"Bounding Linear Programs by Constraint Propagation: Application to Max-SAT","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3083066198","doi":"https://doi.org/10.1007/978-3-030-58475-7_11","mag":"3083066198"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-58475-7_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-58475-7_11","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":"book-chapter","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/A5053960768","display_name":"Tom\u00e1\u0161 Dlask","orcid":"https://orcid.org/0000-0002-1944-6569"},"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":false,"raw_author_name":"Tom\u00e1\u0161 Dlask","raw_affiliation_strings":["Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0002-1944-6569","affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","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":false,"raw_author_name":"Tom\u00e1\u0161 Werner","raw_affiliation_strings":["Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0002-6161-7157","affiliations":[{"raw_affiliation_string":"Faculty of Electrical Engineering, Czech Technical University in Prague, Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.0087,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.94052815,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"177","last_page":"193"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9988999962806702,"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.9988999962806702,"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/T10142","display_name":"Formal Methods in Verification","score":0.9894999861717224,"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/T11182","display_name":"Auction Theory and Applications","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/local-consistency","display_name":"Local consistency","score":0.8980025053024292},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.805747389793396},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.6302934288978577},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.5919747948646545},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.588006854057312},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.5184435844421387},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5101147294044495},{"id":"https://openalex.org/keywords/linear-inequality","display_name":"Linear inequality","score":0.5078909993171692},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4662569761276245},{"id":"https://openalex.org/keywords/linear-space","display_name":"Linear space","score":0.4240758419036865},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.42326992750167847},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41521790623664856},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.4033696949481964},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3665742576122284},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.366301029920578},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3490539491176605},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09198853373527527},{"id":"https://openalex.org/keywords/inequality","display_name":"Inequality","score":0.07591590285301208}],"concepts":[{"id":"https://openalex.org/C137105694","wikidata":"https://www.wikidata.org/wiki/Q3407510","display_name":"Local consistency","level":4,"score":0.8980025053024292},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.805747389793396},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.6302934288978577},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.5919747948646545},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.588006854057312},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.5184435844421387},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5101147294044495},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.5078909993171692},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4662569761276245},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.4240758419036865},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.42326992750167847},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41521790623664856},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.4033696949481964},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3665742576122284},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.366301029920578},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3490539491176605},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09198853373527527},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.07591590285301208},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","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/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-030-58475-7_11","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-58475-7_11","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W287611495","https://openalex.org/W1502653686","https://openalex.org/W1560379432","https://openalex.org/W1563600186","https://openalex.org/W1609596465","https://openalex.org/W1894390600","https://openalex.org/W1963547452","https://openalex.org/W1971861370","https://openalex.org/W1988443389","https://openalex.org/W1990919660","https://openalex.org/W2002478775","https://openalex.org/W2029564784","https://openalex.org/W2053913299","https://openalex.org/W2062200659","https://openalex.org/W2120340025","https://openalex.org/W2135414191","https://openalex.org/W2135588736","https://openalex.org/W2149474573","https://openalex.org/W2164918853","https://openalex.org/W2611804663","https://openalex.org/W2995736486","https://openalex.org/W2996016097","https://openalex.org/W3083640519","https://openalex.org/W3106137083","https://openalex.org/W4293052541","https://openalex.org/W4300550233","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W2118249115","https://openalex.org/W2569549435","https://openalex.org/W2091348864","https://openalex.org/W2784687883","https://openalex.org/W4303044088","https://openalex.org/W96881443","https://openalex.org/W2216566009","https://openalex.org/W2141935412","https://openalex.org/W2140769824","https://openalex.org/W2139423517"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}