{"id":"https://openalex.org/W7148580502","doi":"https://doi.org/10.1007/s10601-026-09410-8","title":"Approximating Pareto frontiers in stochastic multi-objective optimization via hashing and randomization","display_name":"Approximating Pareto frontiers in stochastic multi-objective optimization via hashing and randomization","publication_year":2026,"publication_date":"2026-10-27","ids":{"openalex":"https://openalex.org/W7148580502","doi":"https://doi.org/10.1007/s10601-026-09410-8"},"language":"en","primary_location":{"id":"doi:10.1007/s10601-026-09410-8","doi":"https://doi.org/10.1007/s10601-026-09410-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10601-026-09410-8","pdf_url":null,"source":{"id":"https://openalex.org/S75534514","display_name":"Constraints","issn_l":"1383-7133","issn":["1383-7133","1572-9354"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-40","russia-white-list-1","vabb-shw"],"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":"Constraints","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1007/s10601-026-09410-8","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5132749423","display_name":"Jinzhao Li","orcid":"https://orcid.org/0009-0005-4254-7607","observed_orcids":["https://orcid.org/0009-0005-4254-7607"]},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jinzhao Li","raw_affiliation_strings":["Department of Computer Science, Purdue University, 610 Purdue Mall, West Lafayette, IN, 47907, USA"],"raw_orcid":"https://orcid.org/0009-0005-4254-7607","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, 610 Purdue Mall, West Lafayette, IN, 47907, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5132828075","display_name":"Nan Jiang","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I164936912","display_name":"The University of Texas at El Paso","ror":"https://ror.org/04d5vba33","country_code":"US","type":"education","lineage":["https://openalex.org/I164936912"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nan Jiang","raw_affiliation_strings":["Department of Computer Science, University of Texas at El Paso, 500 W University Ave, El Paso, TX, 79968, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Texas at El Paso, 500 W University Ave, El Paso, TX, 79968, USA","institution_ids":["https://openalex.org/I164936912"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060838579","display_name":"Yexiang Xue","orcid":"https://orcid.org/0000-0002-4533-0543","observed_orcids":["https://orcid.org/0000-0002-4533-0543"]},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yexiang Xue","raw_affiliation_strings":["Department of Computer Science, Purdue University, 610 Purdue Mall, West Lafayette, IN, 47907, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Purdue University, 610 Purdue Mall, West Lafayette, IN, 47907, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5132749423"],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":{"value":3090,"currency":"USD","value_usd":3090},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21121213,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9926999807357788,"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.9926999807357788,"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.0044999998062849045,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/stochastic-multi-objective-optimization","display_name":"stochastic multi-objective optimization","score":0.9990000128746033},{"id":"https://openalex.org/keywords/pareto-front-approximation","display_name":"Pareto front approximation","score":0.9440000057220459},{"id":"https://openalex.org/keywords/hashing","display_name":"hashing","score":0.4300000071525574},{"id":"https://openalex.org/keywords/randomization","display_name":"randomization","score":0.8709999918937683},{"id":"https://openalex.org/keywords/p-hardness","display_name":"#P-hardness","score":0.6330000162124634},{"id":"https://openalex.org/keywords/approximation-guarantees","display_name":"approximation guarantees","score":0.5699999928474426},{"id":"https://openalex.org/keywords/supply-chain-design","display_name":"supply chain design","score":0.9150000214576721},{"id":"https://openalex.org/keywords/probabilistic-inference","display_name":"probabilistic inference","score":0.5720000267028809}],"concepts":[{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.7459999918937683},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6273000240325928},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.5713000297546387},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5626999735832214},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.4943999946117401},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.49399998784065247},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42329999804496765},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.4212000072002411},{"id":"https://openalex.org/C38814450","wikidata":"https://www.wikidata.org/wiki/Q7136870","display_name":"Pareto interpolation","level":4,"score":0.41359999775886536},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3935999870300293},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.3889999985694885},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3833000063896179},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3560999929904938},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.32170000672340393},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.31709998846054077},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30329999327659607},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28220000863075256},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.2782999873161316},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.27730000019073486},{"id":"https://openalex.org/C118127601","wikidata":"https://www.wikidata.org/wiki/Q3797610","display_name":"Pareto analysis","level":3,"score":0.26809999346733093},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.2662000060081482},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.25850000977516174}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10601-026-09410-8","doi":"https://doi.org/10.1007/s10601-026-09410-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10601-026-09410-8","pdf_url":null,"source":{"id":"https://openalex.org/S75534514","display_name":"Constraints","issn_l":"1383-7133","issn":["1383-7133","1572-9354"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-40","russia-white-list-1","vabb-shw"],"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":"Constraints","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2604.01098","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2604.01098","pdf_url":"https://arxiv.org/pdf/2604.01098","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2604.01098","doi":"https://doi.org/10.48550/arxiv.2604.01098","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.01098","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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"}],"best_oa_location":{"id":"doi:10.1007/s10601-026-09410-8","doi":"https://doi.org/10.1007/s10601-026-09410-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10601-026-09410-8","pdf_url":null,"source":{"id":"https://openalex.org/S75534514","display_name":"Constraints","issn_l":"1383-7133","issn":["1383-7133","1572-9354"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-40","russia-white-list-1","vabb-shw"],"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":"Constraints","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G3047343479","display_name":null,"funder_award_id":"DESC0024583","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"},{"id":"https://openalex.org/G38238583","display_name":"FMitF: Collaborative Research: Track I: Embedding Constraint Reasoning in Machine Learning for Better Prediction and Decision-making","funder_award_id":"1918327","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7324831493","display_name":"CAREER: Solving Beyond-NP Satisfiability Modulo Counting Problems with Guarantees Using NP Oracles","funder_award_id":"2339844","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320337510","display_name":"Fusion Energy Sciences","ror":"https://ror.org/02n3j8t12"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7148580502.pdf","grobid_xml":"https://content.openalex.org/works/W7148580502.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4406631828","https://openalex.org/W4407680164","https://openalex.org/W4390809419","https://openalex.org/W3136031552","https://openalex.org/W3148505853","https://openalex.org/W130499561","https://openalex.org/W7169227934","https://openalex.org/W2408724137","https://openalex.org/W2071017454","https://openalex.org/W2963495607"],"abstract_inverted_index":{"Abstract":[0],"Stochastic":[1],"Multi-Objective":[2],"Optimization":[3],"(SMOO)":[4],"is":[5,34,116],"critical":[6],"for":[7,94],"decision-making":[8],"that":[9,167,185],"trades":[10],"off":[11],"multiple":[12],"potentially":[13],"conflicting":[14],"objectives":[15],"in":[16,103,181],"uncertain":[17],"environments.":[18],"SMOO":[19,95,135,213],"aims":[20],"to":[21,38,141],"identify":[22],"the":[23,39,119,194,208],"Pareto":[24,89,114,183],"frontier,":[25],"which":[26],"contains":[27],"all":[28],"mutually":[29],"non-dominating":[30],"decisions.":[31],"The":[32],"problem":[33],"highly":[35,133],"intractable":[36,134],"due":[37],"embedded":[40],"probabilistic":[41],"inference,":[42],"such":[43,54],"as":[44,55],"computing":[45],"marginal":[46],"probabilities,":[47,49],"posterior":[48],"or":[50,68],"expectations.":[51],"Existing":[52],"methods,":[53],"scalarization,":[56],"sample":[57],"average":[58],"approximation,":[59],"and":[60,106,160,176,190,197,210],"evolutionary":[61],"algorithms,":[62],"either":[63],"offer":[64],"arbitrarily":[65],"loose":[66],"approximations":[67],"incur":[69],"prohibitive":[70],"computational":[71],"costs.":[72],"We":[73],"propose":[74],"XOR-SMOO,":[75],"a":[76,98,123],"novel":[77],"algorithm":[78],"that,":[79],"with":[80,138,174],"probability":[81],"$$\\varvec{1-\\delta":[82],"}$$":[83,87,105,108,112,128],",":[84],"obtains":[85],"$$\\varvec{\\gamma":[86,104,111,127],"-approximate":[88,113],"frontiers":[90,184],"(":[91],"$$\\varvec{\\gamma>1}$$":[92],")":[93],"by":[96,122],"querying":[97],"SAT":[99,142],"oracle":[100],"poly-log":[101],"times":[102],"$$\\varvec{\\delta":[107],".":[109,129],"A":[110],"frontier":[115,121],"only":[117,139],"below":[118],"true":[120],"fixed,":[124],"multiplicative":[125],"factor":[126,148],"Thus,":[130],"XOR-SMOO":[131,168,205],"solves":[132],"problems":[136],"(#P-hard)":[137],"queries":[140],"oracles":[143],"while":[144],"obtaining":[145],"tight,":[146],"constant":[147],"approximation":[149],"guarantees.":[150],"Experiments":[151],"on":[152],"challenging":[153],"road":[154],"network":[155],"strengthening,":[156],"supply":[157],"chain":[158],"design,":[159],"regional":[161],"access":[162],"under":[163],"rare":[164],"disruptions":[165],"demonstrate":[166],"outperforms":[169],"state-of-the-art":[170],"evolutionary-based":[171],"multi-objective":[172],"optimizers":[173],"exact":[175],"approximate":[177],"objective":[178,188],"function":[179],"evaluators":[180],"identifying":[182],"have":[186],"higher":[187],"values":[189],"better":[191],"coverage":[192],"of":[193,212],"optimal":[195],"solutions,":[196],"whose":[198],"solutions":[199],"are":[200],"more":[201],"evenly":[202],"distributed.":[203],"Overall,":[204],"significantly":[206],"enhanced":[207],"practicality":[209],"reliability":[211],"solvers.":[214]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2026-04-03T00:00:00"}