{"id":"https://openalex.org/W7214766639","doi":"https://doi.org/10.48550/arxiv.2609.33946","title":"An Intersection Cutting Plane Algorithm for Chance-Constrained Programs with Finite Support","display_name":"An Intersection Cutting Plane Algorithm for Chance-Constrained Programs with Finite Support","publication_year":2026,"publication_date":"2026-09-27","ids":{"openalex":"https://openalex.org/W7214766639","doi":"https://doi.org/10.48550/arxiv.2609.33946"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.33946","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.33946","pdf_url":"https://arxiv.org/pdf/2609.33946","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.33946","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061439701","display_name":"Soumya Ranjan Pathy","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pathy, Soumya Ranjan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5085140086","display_name":"Hamed Rahimian","orcid":"https://orcid.org/0000-0003-1385-4120","observed_orcids":["https://orcid.org/0000-0003-1385-4120"]},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rahimian, Hamed","raw_affiliation_strings":["Department of Industrial Engineering , Clemson University , Clemson SC 29634 , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering , Clemson University , Clemson SC 29634 , USA","institution_ids":["https://openalex.org/I8078737"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.9326000213623047,"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.9326000213623047,"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.04619999974966049,"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.002400000113993883,"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/finite-support","display_name":"finite support","score":0.8299999833106995},{"id":"https://openalex.org/keywords/intersection-cuts","display_name":"intersection cuts","score":0.9319999814033508},{"id":"https://openalex.org/keywords/mixed-integer-programming-reformulation","display_name":"mixed-integer programming reformulation","score":0.7129999995231628},{"id":"https://openalex.org/keywords/submodularity","display_name":"submodular functions","score":0.906000018119812},{"id":"https://openalex.org/keywords/production-and-distribution-planning","display_name":"production and distribution planning","score":0.9509999752044678}],"concepts":[{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.770799994468689},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5663999915122986},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5569999814033508},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5530999898910522},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5382000207901001},{"id":"https://openalex.org/C162392398","wikidata":"https://www.wikidata.org/wiki/Q272404","display_name":"Finite set","level":2,"score":0.49779999256134033},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4778999984264374},{"id":"https://openalex.org/C138777275","wikidata":"https://www.wikidata.org/wiki/Q6884054","display_name":"Mixing (physics)","level":2,"score":0.46059998869895935},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.4453999996185303},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.42899999022483826},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.4230000078678131},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.4203000068664551},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.37220001220703125},{"id":"https://openalex.org/C109839438","wikidata":"https://www.wikidata.org/wiki/Q1762039","display_name":"Cutting-plane method","level":3,"score":0.36820000410079956},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.3483999967575073},{"id":"https://openalex.org/C118671147","wikidata":"https://www.wikidata.org/wiki/Q578714","display_name":"Quantile","level":2,"score":0.3433000147342682},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.326200008392334},{"id":"https://openalex.org/C2776061190","wikidata":"https://www.wikidata.org/wiki/Q7451805","display_name":"Separation (statistics)","level":2,"score":0.3215000033378601},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.3165000081062317},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.2935999929904938},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.28790000081062317},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.2815999984741211},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.274399995803833},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.2583000063896179},{"id":"https://openalex.org/C204241405","wikidata":"https://www.wikidata.org/wiki/Q461499","display_name":"Transformation (genetics)","level":3,"score":0.2551000118255615}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.33946","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.33946","pdf_url":"https://arxiv.org/pdf/2609.33946","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2609.33946","doi":"https://doi.org/10.48550/arxiv.2609.33946","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.33946","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":"pmh:oai:arXiv.org:2609.33946","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.33946","pdf_url":"https://arxiv.org/pdf/2609.33946","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G2013088438","display_name":null,"funder_award_id":"II NEW 1405767","funder_id":"https://openalex.org/F4320309106","funder_display_name":"Clemson University"},{"id":"https://openalex.org/G2640189751","display_name":null,"funder_award_id":"MRI 1725573","funder_id":"https://openalex.org/F4320309106","funder_display_name":"Clemson University"},{"id":"https://openalex.org/G3328667828","display_name":"MRI: Acquisition of a Cyberinstrument for Interdisciplinary Computational Science and Engineering","funder_award_id":"1725573","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G3595647918","display_name":null,"funder_award_id":"MRI 2018069","funder_id":"https://openalex.org/F4320309106","funder_display_name":"Clemson University"},{"id":"https://openalex.org/G4753560203","display_name":null,"funder_award_id":"MRI 1228312","funder_id":"https://openalex.org/F4320309106","funder_display_name":"Clemson University"},{"id":"https://openalex.org/G4993464105","display_name":"MRI: Acquisition of a Cyberinstrument for AI-Enabled Computational Science & Engineering","funder_award_id":"2018069","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7090116110","display_name":null,"funder_award_id":"FA9550","funder_id":"https://openalex.org/F4320332467","funder_display_name":"U.S. Air Force"},{"id":"https://openalex.org/G7270239066","display_name":"MRI:  Acquisition of High Performance Computing Instrument for Collaborative Data-Enabled Science","funder_award_id":"1228312","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7632170509","display_name":"II NEW:  Infrastructure to Support Research in Network-Aware Data-Intensive Computing","funder_award_id":"1405767","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8419962090","display_name":null,"funder_award_id":"NEW 1405767","funder_id":"https://openalex.org/F4320309106","funder_display_name":"Clemson University"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309106","display_name":"Clemson University","ror":"https://ror.org/037s24f05"},{"id":"https://openalex.org/F4320332467","display_name":"U.S. Air Force","ror":"https://ror.org/006gmme17"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7214766639.pdf","grobid_xml":"https://content.openalex.org/works/W7214766639.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W4415967097"],"related_works":["https://openalex.org/W2565581500","https://openalex.org/W2041977479","https://openalex.org/W4399794266","https://openalex.org/W2761367796","https://openalex.org/W2794099954","https://openalex.org/W2490032628","https://openalex.org/W3124635294","https://openalex.org/W7124515199","https://openalex.org/W7203886648","https://openalex.org/W1812936472"],"abstract_inverted_index":{"Standard":[0],"Big-M":[1],"mixed-integer":[2],"programming":[3],"reformulations":[4],"of":[5,23,34,53],"chance-constrained":[6],"programs":[7],"(CCPs)":[8],"with":[9,78],"finite":[10],"support":[11],"often":[12],"yield":[13],"weak":[14],"linear":[15],"relaxations":[16],"and":[17,41,75],"scale":[18],"poorly":[19],"as":[20],"the":[21,50,54,59,79,92],"number":[22],"scenarios":[24],"increases.":[25],"To":[26],"address":[27],"this":[28],"limitation,":[29],"we":[30],"derive":[31],"two":[32],"families":[33],"intersection":[35,81],"cuts":[36,77],"from":[37],"problem-specific":[38],"S-free":[39],"sets":[40],"develop":[42],"decomposition-based":[43],"branch-and-cut":[44],"frameworks.":[45],"The":[46],"first":[47],"one":[48,61],"exploits":[49],"submodular":[51],"structure":[52],"scenario":[55],"requirement":[56],"function,":[57],"while":[58],"second":[60],"uses":[62],"probability":[63],"covers.":[64],"We":[65],"propose":[66],"hybrid":[67,94],"separation":[68],"strategies":[69],"that":[70,91],"combine":[71],"classical":[72],"mixing":[73],"inequalities":[74],"quantile":[76],"proposed":[80,93],"cuts.":[82],"Computational":[83],"experiments":[84],"on":[85],"integrated":[86],"production-distribution":[87],"planning":[88],"instances":[89],"show":[90],"methods":[95],"reduce":[96],"computational":[97],"time":[98],"compared":[99],"to":[100],"pure":[101],"methods.":[102]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-30T00:00:00"}