{"id":"https://openalex.org/W7156165747","doi":"https://doi.org/10.48550/arxiv.2604.21961","title":"A general optimization solver based on OP-to-MaxSAT reduction","display_name":"A general optimization solver based on OP-to-MaxSAT reduction","publication_year":2026,"publication_date":"2026-04-23","ids":{"openalex":"https://openalex.org/W7156165747","doi":"https://doi.org/10.48550/arxiv.2604.21961"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.21961","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.21961","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.21961","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057246186","display_name":"Yuxin Zhao","orcid":"https://orcid.org/0000-0003-1214-2391"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhao, Yuxin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100709581","display_name":"Han Huang","orcid":"https://orcid.org/0000-0003-3353-2970"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Han","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5134660975","display_name":"Zhifeng Hao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hao, Zhifeng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.38679999113082886,"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.38679999113082886,"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.21410000324249268,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.11569999903440475,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/reduction","display_name":"Reduction (mathematics)","score":0.6858000159263611},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.6470999717712402},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6462000012397766},{"id":"https://openalex.org/keywords/generality","display_name":"Generality","score":0.6000999808311462},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5695000290870667},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5407000184059143},{"id":"https://openalex.org/keywords/continuous-optimization","display_name":"Continuous optimization","score":0.4196000099182129},{"id":"https://openalex.org/keywords/engineering-optimization","display_name":"Engineering optimization","score":0.37389999628067017}],"concepts":[{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.6858000159263611},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.6470999717712402},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6462000012397766},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.6000999808311462},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5771999955177307},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5695000290870667},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5455999970436096},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5407000184059143},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.4196000099182129},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39169999957084656},{"id":"https://openalex.org/C110850998","wikidata":"https://www.wikidata.org/wiki/Q5377895","display_name":"Engineering optimization","level":3,"score":0.37389999628067017},{"id":"https://openalex.org/C62114133","wikidata":"https://www.wikidata.org/wiki/Q5366944","display_name":"L-reduction","level":5,"score":0.3463999927043915},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3269999921321869},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31540000438690186},{"id":"https://openalex.org/C145671259","wikidata":"https://www.wikidata.org/wiki/Q1493786","display_name":"Discrete optimization","level":3,"score":0.31049999594688416},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.2924000024795532},{"id":"https://openalex.org/C56858530","wikidata":"https://www.wikidata.org/wiki/Q15947151","display_name":"Reduction strategy","level":2,"score":0.2913999855518341},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.28380000591278076},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.2800999879837036},{"id":"https://openalex.org/C29282572","wikidata":"https://www.wikidata.org/wiki/Q16977029","display_name":"Derivative-free optimization","level":4,"score":0.2784000039100647},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.2741999924182892},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.2709999978542328},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.2667999863624573}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.21961","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.21961","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.21961","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.21961","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Optimization":[0],"problems":[1,66,70,73,122,187],"are":[2,17,95],"fundamental":[3],"in":[4,28,77,128,173,181],"diverse":[5,167],"fields,":[6],"such":[7],"as":[8],"engineering,":[9],"economics,":[10],"and":[11,24,47,80,90],"scientific":[12],"computing.":[13],"However,":[14],"current":[15],"algorithms":[16,156],"mostly":[18],"designed":[19],"for":[20,157,166],"specific":[21],"problem":[22,159],"types":[23,31,63,104],"exhibit":[25],"limited":[26],"generality":[27,89],"solving":[29,60,81],"multiple":[30,62],"of":[32,61,64,93,105,120,150,185],"optimization":[33,50,65,72,106,121,151,186],"problems.":[34,107,168],"To":[35],"enhance":[36],"generality,":[37],"we":[38],"propose":[39],"an":[40],"automated":[41,143],"reduction":[42,46,55],"method":[43],"named":[44],"OP-to-MaxSAT":[45,54],"a":[48,117,163,170,182],"general":[49],"solver":[51],"based":[52],"on":[53,99],"(GORED).":[56],"GORED":[57,94,112],"unifies":[58],"the":[59,69,84,148],"by":[67],"reducing":[68],"from":[71,132,153],"to":[74,130,161],"MaxSAT":[75,86],"instances":[76,101],"polynomial":[78],"time":[79],"them":[82],"using":[83],"state-of-the-art":[85],"solver.":[87],"The":[88],"solution":[91],"quality":[92,129],"validated":[96],"through":[97],"experiments":[98],"136":[100],"across":[102,188],"11":[103],"Experimental":[108],"results":[109],"demonstrate":[110],"that":[111],"not":[113],"only":[114],"successfully":[115],"solves":[116],"wide":[118,183],"range":[119,184],"but":[123],"also":[124],"yields":[125],"solutions":[126],"comparable":[127],"those":[131],"existing":[133],"methods,":[134],"with":[135],"no":[136],"statistically":[137],"significant":[138],"differences":[139],"observed.":[140],"By":[141],"introducing":[142],"reduction,":[144],"this":[145,174],"work":[146],"shifts":[147],"paradigm":[149],"solvers":[152],"designing":[154],"specialized":[155],"each":[158],"type":[160],"employing":[162],"single":[164,175],"algorithm":[165,176],"As":[169],"result,":[171],"advances":[172],"can":[177],"now":[178],"drive":[179],"progress":[180],"various":[189],"domains.":[190]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-28T00:00:00"}