{"id":"https://openalex.org/W2890618250","doi":"https://doi.org/10.1137/17m1158707","title":"Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information","display_name":"Ambiguous Chance-Constrained Binary Programs under Mean-Covariance Information","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2890618250","doi":"https://doi.org/10.1137/17m1158707","mag":"2890618250"},"language":"en","primary_location":{"id":"doi:10.1137/17m1158707","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1158707","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1610.00035","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yiling Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yiling Zhang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Ruiwei Jiang","orcid":"https://orcid.org/0000-0002-3941-5057"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ruiwei Jiang","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-3941-5057","affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Siqian Shen","orcid":"https://orcid.org/0000-0002-2854-163X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Siqian Shen","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0002-2854-163X","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":7.0453,"has_fulltext":false,"cited_by_count":83,"citation_normalized_percentile":{"value":0.9707643,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"28","issue":"4","first_page":"2922","last_page":"2944"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9164999723434448,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9164999723434448,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.017999999225139618,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.012900000438094139,"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/binary-number","display_name":"Binary number","score":0.6646000146865845},{"id":"https://openalex.org/keywords/covariance","display_name":"Covariance","score":0.6365000009536743},{"id":"https://openalex.org/keywords/ambiguity","display_name":"Ambiguity","score":0.5727999806404114},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.47699999809265137},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43290001153945923},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4011000096797943},{"id":"https://openalex.org/keywords/covariance-matrix","display_name":"Covariance matrix","score":0.3815000057220459},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3758000135421753},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.3571000099182129}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7164000272750854},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6646000146865845},{"id":"https://openalex.org/C178650346","wikidata":"https://www.wikidata.org/wiki/Q201984","display_name":"Covariance","level":2,"score":0.6365000009536743},{"id":"https://openalex.org/C2780522230","wikidata":"https://www.wikidata.org/wiki/Q1140419","display_name":"Ambiguity","level":2,"score":0.5727999806404114},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5552999973297119},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.47699999809265137},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4571000039577484},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43290001153945923},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4011000096797943},{"id":"https://openalex.org/C185142706","wikidata":"https://www.wikidata.org/wiki/Q1134404","display_name":"Covariance matrix","level":2,"score":0.3815000057220459},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3758000135421753},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3571000099182129},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3449999988079071},{"id":"https://openalex.org/C18555067","wikidata":"https://www.wikidata.org/wiki/Q8375051","display_name":"Joint (building)","level":2,"score":0.34310001134872437},{"id":"https://openalex.org/C207390915","wikidata":"https://www.wikidata.org/wiki/Q1230525","display_name":"Divergence (linguistics)","level":2,"score":0.3328999876976013},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3264000117778778},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.3246000111103058},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.32350000739097595},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.3172000050544739},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3027999997138977},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.2955000102519989},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.29440000653266907},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27709999680519104},{"id":"https://openalex.org/C2779190172","wikidata":"https://www.wikidata.org/wiki/Q4913888","display_name":"Binary data","level":3,"score":0.2757999897003174},{"id":"https://openalex.org/C2777169571","wikidata":"https://www.wikidata.org/wiki/Q5158328","display_name":"Concentration inequality","level":2,"score":0.2705000042915344},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.26190000772476196},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.251800000667572}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/17m1158707","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1158707","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1610.00035","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1610.00035","pdf_url":"https://arxiv.org/pdf/1610.00035","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1610.00035","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1610.00035","pdf_url":"https://arxiv.org/pdf/1610.00035","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1065721340","display_name":null,"funder_award_id":"CMMI-1433066","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3047330924","display_name":null,"funder_award_id":"CMMI-1662774","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"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W760153864","https://openalex.org/W1519286527","https://openalex.org/W1680189815","https://openalex.org/W1967729795","https://openalex.org/W1968355947","https://openalex.org/W1978686733","https://openalex.org/W1989755892","https://openalex.org/W1993599556","https://openalex.org/W2002307851","https://openalex.org/W2012489386","https://openalex.org/W2021472931","https://openalex.org/W2037187765","https://openalex.org/W2041977479","https://openalex.org/W2056940756","https://openalex.org/W2067796483","https://openalex.org/W2085488723","https://openalex.org/W2086548770","https://openalex.org/W2092660864","https://openalex.org/W2096011304","https://openalex.org/W2105294778","https://openalex.org/W2125417745","https://openalex.org/W2143514150","https://openalex.org/W2148870598","https://openalex.org/W2151140685","https://openalex.org/W2156168813","https://openalex.org/W2159309155","https://openalex.org/W2164499670","https://openalex.org/W2963897604"],"related_works":[],"abstract_inverted_index":{"We":[0,55,90,103],"consider":[1],"chance-constrained":[2,35,116],"binary":[3,36],"programs,":[4],"where":[5],"each":[6],"row":[7],"of":[8,22,60,114],"the":[9,20,23,47,58,73,86,92,105],"inequalities":[10,83,94],"that":[11],"involve":[12],"uncertainty":[13],"needs":[14],"to":[15,79,84],"be":[16],"satisfied":[17],"probabilistically.":[18],"Only":[19],"information":[21],"mean":[24],"and":[25,30,66,70,108],"covariance":[26,68],"matrix":[27],"is":[28],"available,":[29],"we":[31,44,71],"solve":[32],"distributionally":[33],"robust":[34],"programs":[37],"(DCBP).":[38],"Using":[39],"two":[40],"different":[41],"ambiguity":[42],"sets,":[43],"equivalently":[45],"reformulate":[46],"DCBPs":[48],"as":[49,75,77],"0-1":[50,61,87],"second-order":[51],"cone":[52],"(SOC)":[53],"programs.":[54],"further":[56],"exploit":[57],"submodularity":[59,74],"SOC":[62,88],"constraints":[63],"under":[64],"special":[65],"general":[67],"matrices,":[69],"utilize":[72],"well":[76],"lifting":[78],"derive":[80],"extended":[81],"polymatroid":[82],"strengthen":[85],"formulations.":[89],"incorporate":[91],"valid":[93],"in":[95],"a":[96,115],"branch-and-cut":[97],"algorithm":[98],"for":[99],"efficiently":[100],"solving":[101],"DCBPs.":[102],"demonstrate":[104],"computational":[106],"efficacy":[107],"solution":[109],"performance":[110],"using":[111],"diverse":[112],"instances":[113],"bin":[117],"packing":[118],"problem.":[119]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":20},{"year":2021,"cited_by_count":12},{"year":2020,"cited_by_count":11},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2018-09-27T00:00:00"}