{"id":"https://openalex.org/W3152212242","doi":"https://doi.org/10.3390/a14040115","title":"Dynamic Initial Weight Assignment for MaxSAT","display_name":"Dynamic Initial Weight Assignment for MaxSAT","publication_year":2021,"publication_date":"2021-03-31","ids":{"openalex":"https://openalex.org/W3152212242","doi":"https://doi.org/10.3390/a14040115","mag":"3152212242"},"language":"en","primary_location":{"id":"doi:10.3390/a14040115","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14040115","pdf_url":"https://www.mdpi.com/1999-4893/14/4/115/pdf?version=1617938690","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/14/4/115/pdf?version=1617938690","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048330473","display_name":"Abdelraouf Ishtaiwi","orcid":"https://orcid.org/0000-0001-8013-7151"},"institutions":[{"id":"https://openalex.org/I36622005","display_name":"Petra University","ror":"https://ror.org/039d9es10","country_code":"JO","type":"education","lineage":["https://openalex.org/I36622005"]}],"countries":["JO"],"is_corresponding":true,"raw_author_name":"Abdelraouf Ishtaiwi","raw_affiliation_strings":["Department of Data Science and Artificial Intelligence, Faculty of Information Technology, University of Petra, Amman 317, Jordan"],"affiliations":[{"raw_affiliation_string":"Department of Data Science and Artificial Intelligence, Faculty of Information Technology, University of Petra, Amman 317, Jordan","institution_ids":["https://openalex.org/I36622005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018588641","display_name":"Qasem Abu Al\u2010Haija","orcid":"https://orcid.org/0000-0003-2422-0297"},"institutions":[{"id":"https://openalex.org/I36622005","display_name":"Petra University","ror":"https://ror.org/039d9es10","country_code":"JO","type":"education","lineage":["https://openalex.org/I36622005"]}],"countries":["JO"],"is_corresponding":false,"raw_author_name":"Qasem Abu Al-Haija","raw_affiliation_strings":["Department of Data Science and Artificial Intelligence, Faculty of Information Technology, University of Petra, Amman 317, Jordan"],"affiliations":[{"raw_affiliation_string":"Department of Data Science and Artificial Intelligence, Faculty of Information Technology, University of Petra, Amman 317, Jordan","institution_ids":["https://openalex.org/I36622005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048330473"],"corresponding_institution_ids":["https://openalex.org/I36622005"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04374706,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"14","issue":"4","first_page":"115","last_page":"115"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9987000226974487,"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"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9983000159263611,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9980000257492065,"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/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.9477064609527588},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.8238652944564819},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.7032712697982788},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6605483889579773},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5064684152603149},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4765254259109497},{"id":"https://openalex.org/keywords/conjunctive-normal-form","display_name":"Conjunctive normal form","score":0.46228718757629395},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44167935848236084},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40004876255989075},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.07981419563293457}],"concepts":[{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.9477064609527588},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.8238652944564819},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.7032712697982788},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6605483889579773},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5064684152603149},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4765254259109497},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.46228718757629395},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44167935848236084},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40004876255989075},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.07981419563293457}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3390/a14040115","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14040115","pdf_url":"https://www.mdpi.com/1999-4893/14/4/115/pdf?version=1617938690","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:cb7845faca004372ac9a2cc3d87097d1","is_oa":true,"landing_page_url":"https://doaj.org/article/cb7845faca004372ac9a2cc3d87097d1","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 14, Iss 4, p 115 (2021)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/14/4/115/","is_oa":true,"landing_page_url":"https://dx.doi.org/10.3390/a14040115","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms; Volume 14; Issue 4; Pages: 115","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a14040115","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a14040115","pdf_url":"https://www.mdpi.com/1999-4893/14/4/115/pdf?version=1617938690","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3152212242.pdf","grobid_xml":"https://content.openalex.org/works/W3152212242.grobid-xml"},"referenced_works_count":49,"referenced_works":["https://openalex.org/W13289598","https://openalex.org/W18766686","https://openalex.org/W51584572","https://openalex.org/W125178576","https://openalex.org/W1039949627","https://openalex.org/W1063842838","https://openalex.org/W1496083386","https://openalex.org/W1502125971","https://openalex.org/W1506255457","https://openalex.org/W1513769081","https://openalex.org/W1531103278","https://openalex.org/W1537595897","https://openalex.org/W1913543287","https://openalex.org/W2016381622","https://openalex.org/W2017794496","https://openalex.org/W2028438572","https://openalex.org/W2036265926","https://openalex.org/W2084792706","https://openalex.org/W2094716844","https://openalex.org/W2104670598","https://openalex.org/W2139168414","https://openalex.org/W2153638045","https://openalex.org/W2154061444","https://openalex.org/W2164855953","https://openalex.org/W2335698967","https://openalex.org/W2345507442","https://openalex.org/W2480832319","https://openalex.org/W2483910514","https://openalex.org/W2484319280","https://openalex.org/W2486285674","https://openalex.org/W2487140311","https://openalex.org/W2501112583","https://openalex.org/W2581275558","https://openalex.org/W2595603750","https://openalex.org/W2606496334","https://openalex.org/W2995373617","https://openalex.org/W2995451033","https://openalex.org/W3042858184","https://openalex.org/W3044242234","https://openalex.org/W3047951819","https://openalex.org/W3119579184","https://openalex.org/W4244448683","https://openalex.org/W4246598646","https://openalex.org/W4255675760","https://openalex.org/W4299796063","https://openalex.org/W6600528508","https://openalex.org/W6674059337","https://openalex.org/W6704699334","https://openalex.org/W6771439521"],"related_works":["https://openalex.org/W2301405299","https://openalex.org/W2394616262","https://openalex.org/W3152212242","https://openalex.org/W2480084299","https://openalex.org/W2963321374","https://openalex.org/W2408080066","https://openalex.org/W2014111643","https://openalex.org/W2406837904","https://openalex.org/W2571882453","https://openalex.org/W4211028879"],"abstract_inverted_index":{"The":[0],"Maximum":[1,116],"Satisfiability":[2,4,64,117],"(Maximum":[3],"(MaxSAT))":[5],"approach":[6],"is":[7,40],"the":[8,12,28,61,71,76,89,96,102,106,161,168,180,192,199,207],"choice,":[9],"and":[10,33,45,53,108,121,156,184],"perhaps":[11],"only":[13],"one,":[14],"to":[15,36,43,87,129,198,213],"deal":[16],"with":[17,217],"most":[18,22,77],"real-world":[19,38],"problems":[20,52,138,183],"as":[21],"of":[23,57,63,74,99,134,163,170,177,182,194],"them":[24],"are":[25,56],"unsatisfiable.":[26],"Thus,":[27],"search":[29],"for":[30,115],"a":[31,37,49,131],"complete":[32],"consistent":[34],"solution":[35],"problem":[39],"impractical":[41],"due":[42],"computational":[44],"time":[46],"constraints.":[47],"As":[48],"result,":[50],"MaxSAT":[51,90,137,216],"solving":[54,152],"techniques":[55],"exceptional":[58],"interest":[59],"in":[60,105],"domain":[62],"(Satisfiability":[65],"(SAT)).":[66],"Our":[67],"research":[68],"experimentally":[69],"investigated":[70,95],"performance":[72,97,146,169,193],"gains":[73,98],"extending":[75],"recently":[78],"developed":[79],"SAT":[80,151],"dynamic":[81,164],"Initial":[82],"Weight":[83,114],"assignment":[84,162],"technique":[85,209],"(InitWeight)":[86],"handle":[88],"problems.":[91],"Specifically,":[92],"we":[93,143,189,204],"first":[94],"dynamically":[100],"assigning":[101],"initial":[103,165],"weights":[104,166],"Divide":[107,120],"Distribute":[109,122],"Fixed":[110,123],"Weights":[111,124],"solver":[112,125],"(DDFW+Initial":[113],"(DDFW+InitMaxSAT))":[118],"over":[119],"(DDFW)":[126],"when":[127],"applied":[128],"solve":[130],"wide":[132],"range":[133],"well-known":[135],"unweighted":[136],"obtained":[139],"from":[140],"DIMACS.":[141],"Secondly,":[142],"compared":[144],"DDFW+InitMaxSAT\u2019s":[145],"against":[147,172],"three":[148],"known":[149],"state-of-the-art":[150,201],"techniques:":[153],"YalSAT,":[154],"ProbSAT,":[155],"Sparrow.":[157],"We":[158],"showed":[159,190,205],"that":[160,191,206],"increased":[167],"DDFW+InitMaxSAT":[171,195],"DDFW":[173],"by":[174],"an":[175],"order":[176],"magnitude":[178],"on":[179],"majority":[181],"performed":[185],"similarly":[186],"otherwise.":[187],"Furthermore,":[188],"was":[196],"superior":[197],"other":[200],"algorithms.":[202],"Eventually,":[203],"InitWeight":[208],"could":[210],"be":[211],"extended":[212],"handling":[214],"partial":[215],"minor":[218],"modifications.":[219]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}