{"id":"https://openalex.org/W7129087631","doi":"https://doi.org/10.1007/s10817-026-09749-w","title":"Unsatisfiability-based Algorithms for Multi-Objective Combinatorial Optimization","display_name":"Unsatisfiability-based Algorithms for Multi-Objective Combinatorial Optimization","publication_year":2026,"publication_date":"2026-02-16","ids":{"openalex":"https://openalex.org/W7129087631","doi":"https://doi.org/10.1007/s10817-026-09749-w"},"language":"en","primary_location":{"id":"doi:10.1007/s10817-026-09749-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10817-026-09749-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10817-026-09749-w.pdf","source":{"id":"https://openalex.org/S99781599","display_name":"Journal of Automated Reasoning","issn_l":"0168-7433","issn":["0168-7433","1573-0670"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Automated Reasoning","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10817-026-09749-w.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078720275","display_name":"Jo\u00e3o Cortes","orcid":"https://orcid.org/0000-0003-4833-8054"},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]}],"countries":["PT"],"is_corresponding":true,"raw_author_name":"Jo\u00e3o Cortes","raw_affiliation_strings":["INESC-ID, Instituto Superior T\u00e9cnico, Universidade de Lisboa,  Lisbon (Lisboa), Portugal"],"raw_orcid":"https://orcid.org/0000-0003-4833-8054","affiliations":[{"raw_affiliation_string":"INESC-ID, Instituto Superior T\u00e9cnico, Universidade de Lisboa,  Lisbon (Lisboa), Portugal","institution_ids":["https://openalex.org/I121345201"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5058622165","display_name":"In\u00eas Lynce","orcid":"https://orcid.org/0000-0003-4868-415X"},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"In\u00eas Lynce","raw_affiliation_strings":["INESC-ID, Instituto Superior T\u00e9cnico, Universidade de Lisboa,  Lisbon (Lisboa), Portugal"],"raw_orcid":"https://orcid.org/0000-0003-4868-415X","affiliations":[{"raw_affiliation_string":"INESC-ID, Instituto Superior T\u00e9cnico, Universidade de Lisboa,  Lisbon (Lisboa), Portugal","institution_ids":["https://openalex.org/I121345201"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5033377932","display_name":"Vasco Manquinho","orcid":"https://orcid.org/0000-0002-4205-2189"},"institutions":[{"id":"https://openalex.org/I121345201","display_name":"Instituto de Engenharia de Sistemas e Computadores Investiga\u00e7\u00e3o e Desenvolvimento","ror":"https://ror.org/04mqy3p58","country_code":"PT","type":"nonprofit","lineage":["https://openalex.org/I121345201","https://openalex.org/I4210125590"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Vasco Manquinho","raw_affiliation_strings":["INESC-ID, Instituto Superior T\u00e9cnico, Universidade de Lisboa,  Lisbon (Lisboa), Portugal"],"raw_orcid":"https://orcid.org/0000-0002-4205-2189","affiliations":[{"raw_affiliation_string":"INESC-ID, Instituto Superior T\u00e9cnico, Universidade de Lisboa,  Lisbon (Lisboa), Portugal","institution_ids":["https://openalex.org/I121345201"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5078720275"],"corresponding_institution_ids":["https://openalex.org/I121345201"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23393665,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"70","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.8306999802589417,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.8306999802589417,"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.07069999724626541,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.015300000086426735,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.6862999796867371},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6262999773025513},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5996999740600586},{"id":"https://openalex.org/keywords/true-quantified-boolean-formula","display_name":"True quantified Boolean formula","score":0.4927999973297119},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.483599990606308},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.47749999165534973},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4706999957561493},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.45750001072883606},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3977999985218048}],"concepts":[{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.6862999796867371},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6262999773025513},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5996999740600586},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5271000266075134},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.522599995136261},{"id":"https://openalex.org/C200415742","wikidata":"https://www.wikidata.org/wiki/Q1350285","display_name":"True quantified Boolean formula","level":2,"score":0.4927999973297119},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.483599990606308},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.47749999165534973},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4706999957561493},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.45750001072883606},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3977999985218048},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3747999966144562},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35679998993873596},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3395000100135803},{"id":"https://openalex.org/C16221470","wikidata":"https://www.wikidata.org/wiki/Q846564","display_name":"Conjunctive normal form","level":2,"score":0.32429999113082886},{"id":"https://openalex.org/C194051981","wikidata":"https://www.wikidata.org/wiki/Q1337691","display_name":"Economic shortage","level":3,"score":0.3224000036716461},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.30140000581741333},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.2784999907016754},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C69562738","wikidata":"https://www.wikidata.org/wiki/Q200694","display_name":"Propositional calculus","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.2556000053882599},{"id":"https://openalex.org/C2988809283","wikidata":"https://www.wikidata.org/wiki/Q1514868","display_name":"Combinatorial algorithms","level":2,"score":0.25529998540878296},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2547000050544739},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.2531000077724457},{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.25130000710487366}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s10817-026-09749-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10817-026-09749-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10817-026-09749-w.pdf","source":{"id":"https://openalex.org/S99781599","display_name":"Journal of Automated Reasoning","issn_l":"0168-7433","issn":["0168-7433","1573-0670"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Automated Reasoning","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s10817-026-09749-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10817-026-09749-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10817-026-09749-w.pdf","source":{"id":"https://openalex.org/S99781599","display_name":"Journal of Automated Reasoning","issn_l":"0168-7433","issn":["0168-7433","1573-0670"],"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":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Automated Reasoning","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2441341484","display_name":"Instituto de Engenharia de Sistemas e Computadores, Investiga\u00e7\u00e3o e Desenvolvimento em Lisboa","funder_award_id":"UIDB/50021/2020","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"},{"id":"https://openalex.org/G3019180854","display_name":null,"funder_award_id":"DOI: 10.54499/UIDB/50021/2020","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"},{"id":"https://openalex.org/G5310039020","display_name":"Coer\u00eancia de Dados em Composi\u00e7\u00f5es de Microservi\u00e7os","funder_award_id":"PTDC/CCI-COM/2156/2021","funder_id":"https://openalex.org/F4320334779","funder_display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia"}],"funders":[{"id":"https://openalex.org/F4320323424","display_name":"Universidade de Lisboa","ror":"https://ror.org/01c27hj86"},{"id":"https://openalex.org/F4320334779","display_name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","ror":"https://ror.org/00snfqn58"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W7129087631.pdf"},"referenced_works_count":49,"referenced_works":["https://openalex.org/W5815757","https://openalex.org/W54684292","https://openalex.org/W82625556","https://openalex.org/W86999719","https://openalex.org/W94133491","https://openalex.org/W111132822","https://openalex.org/W139194355","https://openalex.org/W139322340","https://openalex.org/W192935825","https://openalex.org/W1490423772","https://openalex.org/W1511069520","https://openalex.org/W1518705996","https://openalex.org/W1531103278","https://openalex.org/W1559357575","https://openalex.org/W1769298637","https://openalex.org/W1775352280","https://openalex.org/W1825789089","https://openalex.org/W1968876856","https://openalex.org/W2009689138","https://openalex.org/W2022485595","https://openalex.org/W2046239089","https://openalex.org/W2107470986","https://openalex.org/W2118943303","https://openalex.org/W2130919252","https://openalex.org/W2132220327","https://openalex.org/W2143381319","https://openalex.org/W2167159964","https://openalex.org/W2185680923","https://openalex.org/W2481363456","https://openalex.org/W2507455848","https://openalex.org/W2582889117","https://openalex.org/W2743025482","https://openalex.org/W2750301177","https://openalex.org/W2752285784","https://openalex.org/W2785837881","https://openalex.org/W2935376254","https://openalex.org/W2936542636","https://openalex.org/W2963909831","https://openalex.org/W3035531262","https://openalex.org/W3039293627","https://openalex.org/W3103016263","https://openalex.org/W3110085577","https://openalex.org/W3150741540","https://openalex.org/W3179204519","https://openalex.org/W3211275340","https://openalex.org/W4316039608","https://openalex.org/W4366448450","https://openalex.org/W4399049574","https://openalex.org/W4401304867"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"In":[1,75],"the":[2,17,29,44,73,80,83],"last":[3],"decade,":[4],"numerous":[5],"algorithms":[6,39,121,129],"for":[7,49,130],"single-objective":[8],"Boolean":[9],"optimization":[10],"have":[11],"been":[12],"proposed":[13],"that":[14,117],"rely":[15],"on":[16],"iterative":[18],"usage":[19],"of":[20,31,46,82,85,113],"a":[21,63,69,103],"highly":[22],"effective":[23],"Propositional":[24],"Satisfiability":[25],"(SAT)":[26],"solver.":[27,107],"But":[28],"use":[30],"SAT":[32],"solvers":[33,87],"in":[34,110],"Multi-Objective":[35],"Combinatorial":[36],"Optimization":[37],"(MOCO)":[38],"is":[40,102],"scarce.":[41],"Due":[42],"to":[43],"shortage":[45],"efficient":[47],"tools":[48],"MOCO,":[50],"many":[51],"real-world":[52],"applications":[53],"formulated":[54],"as":[55,59],"multi-objective":[56],"are":[57,96],"cast":[58],"single-objective,":[60],"using":[61],"either":[62],"linear":[64],"combination":[65],"or":[66],"by":[67],"setting":[68],"preference":[70],"order":[71],"among":[72],"objectives.":[74],"this":[76],"paper,":[77],"we":[78],"extend":[79],"state":[81],"art":[84],"MOCO":[86,98,106],"with":[88],"three":[89],"novel":[90],"unsatisfiability-based":[91,120],"algorithms.":[92],"The":[93,100],"first":[94],"two":[95],"core-guided":[97],"solvers.":[99],"third":[101],"hitting":[104],"set":[105],"Experimental":[108],"results":[109],"several":[111],"sets":[112],"benchmark":[114],"instances":[115],"show":[116],"our":[118],"new":[119],"can":[122],"outperform":[123],"and":[124],"complement":[125],"other":[126],"SAT-based,":[127],"state-of-the-art":[128],"MOCO.":[131]},"counts_by_year":[],"updated_date":"2026-06-22T08:00:12.763002","created_date":"2026-02-17T00:00:00"}