{"id":"https://openalex.org/W2397219751","doi":null,"title":"Solving (Weighted) Partial MaxSAT with ILP.","display_name":"Solving (Weighted) Partial MaxSAT with ILP.","alternate_titles":[],"publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2397219751","mag":"2397219751"},"language":"en","primary_location":{"id":"mag:2397219751","doi":null,"is_oa":false,"landing_page_url":"https://computational-sustainability.cis.cornell.edu/cpaior2013/pdfs/ansotegui.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306418929","display_name":"Integration of AI and OR Techniques in Constraint Programming","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Integration of AI and OR Techniques in Constraint Programming","raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2397219751"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5039752849","display_name":"Carlos Ans\u00f3tegui","orcid":"https://orcid.org/0000-0001-7727-2766","observed_orcids":["https://orcid.org/0000-0001-7727-2766"]},"institutions":[{"id":"https://openalex.org/I15766328","display_name":"Universitat de Lleida","ror":"https://ror.org/050c3cw24","country_code":"ES","type":"education","lineage":["https://openalex.org/I15766328"]}],"countries":["ES"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Carlos Ans\u00f3tegui","raw_affiliation_strings":["Universitat de Lleida, Lleida, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universitat de Lleida, Lleida, Spain","institution_ids":["https://openalex.org/I15766328"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052612628","display_name":"Joel Gab\u00e0s","orcid":"https://orcid.org/0009-0000-8591-4490","observed_orcids":["https://orcid.org/0009-0000-8591-4490"]},"institutions":[{"id":"https://openalex.org/I15766328","display_name":"Universitat de Lleida","ror":"https://ror.org/050c3cw24","country_code":"ES","type":"education","lineage":["https://openalex.org/I15766328"]}],"countries":["ES"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Joel Gab\u00e0s","raw_affiliation_strings":["Universitat de Lleida, Lleida, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universitat de Lleida, Lleida, Spain","institution_ids":["https://openalex.org/I15766328"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I15766328"],"apc_list":null,"apc_paid":null,"fwci":5.086,"has_fulltext":false,"cited_by_count":48,"reviewed_by_count":0,"citation_normalized_percentile":{"value":0.95316173,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"403","last_page":"409"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.0015999999595806003,"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.001500000013038516,"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/maxsat","display_name":"MaxSAT","score":0.8209999799728394},{"id":"https://openalex.org/keywords/integer-linear-programming","display_name":"integer linear programming","score":0.7799999713897705},{"id":"https://openalex.org/keywords/mixed-integer-programming","display_name":"mixed integer programming","score":0.9160000085830688},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"branch and bound","score":0.9100000262260437},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.8600000143051147}],"concepts":[{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.9478649497032166},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.7473090291023254},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6954659223556519},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6838963031768799},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.6448901891708374},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.528899610042572},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48562994599342346},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4778299331665039},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4721885919570923},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4704495966434479},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.43318116664886475},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.427295446395874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3312697410583496},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3289836049079895},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.08181938529014587},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2397219751","doi":null,"is_oa":false,"landing_page_url":"https://computational-sustainability.cis.cornell.edu/cpaior2013/pdfs/ansotegui.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306418929","display_name":"Integration of AI and OR Techniques in Constraint Programming","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Integration of AI and OR Techniques in Constraint Programming","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W111132822","https://openalex.org/W125365257","https://openalex.org/W139194355","https://openalex.org/W193459320","https://openalex.org/W1524741427","https://openalex.org/W1531103278","https://openalex.org/W1539228153","https://openalex.org/W1607011516","https://openalex.org/W1775352280","https://openalex.org/W1852879971","https://openalex.org/W1885913205","https://openalex.org/W2004831359","https://openalex.org/W2047240223","https://openalex.org/W2102909639","https://openalex.org/W2107356010","https://openalex.org/W2123757087","https://openalex.org/W2126446661","https://openalex.org/W2128272523","https://openalex.org/W2154593562","https://openalex.org/W2395737562","https://openalex.org/W2404307587"],"related_works":["https://openalex.org/W7096560206","https://openalex.org/W192935825","https://openalex.org/W4413847569","https://openalex.org/W1566938367","https://openalex.org/W7213392327","https://openalex.org/W4417338885","https://openalex.org/W2742009774","https://openalex.org/W4382239472","https://openalex.org/W1578612406","https://openalex.org/W4412374001"],"abstract_inverted_index":{"Several":[0],"combinatorial":[1],"optimization":[2,18],"problems":[3],"can":[4],"be":[5],"translated":[6],"into":[7,91],"the":[8,21,43,69,76,88,95],"Weighted":[9],"Partial":[10],"Maximum":[11],"Satisfiability":[12,22],"(WPMS)":[13],"problem.":[14,24],"This":[15],"is":[16],"an":[17,79,104],"variant":[19],"of":[20,30,78],"(SAT)":[23],"There":[25],"are":[26],"two":[27],"main":[28],"families":[29],"WPMS":[31,89],"solvers":[32,51],"based":[33],"on":[34,53,61,68,114],"SAT":[35],"technology:":[36],"branch":[37,57],"and":[38,40,58,93],"bound":[39,59],"SAT-based.":[41],"From":[42],"MaxSAT":[44],"evaluations,":[45],"we":[46,74,86],"have":[47],"learned":[48],"that":[49,109],"SAT-based":[50],"dominate":[52,60],"industrial":[54],"instances":[55,65],"while":[56],"random.":[62],"For":[63],"crafted":[64,115],"it":[66],"depends":[67],"category.":[70],"In":[71,84],"this":[72,110],"work,":[73],"study":[75],"performance":[77],"Integer":[80,97],"Linear":[81],"Programming":[82,98],"approach.":[83],"particular,":[85],"translate":[87],"problem":[90],"ILP":[92],"apply":[94],"Mixed":[96],"(MIP)":[99],"solver,":[100],"IBMCPLEX.":[101],"We":[102],"present":[103],"extensive":[105],"experimental":[106],"evaluation":[107],"showing":[108],"approach":[111],"clearly":[112],"dominates":[113],"instances.":[116]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2397219751","counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":4}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
