arXiv (All)
open access
An Intersection Cutting Plane Algorithm for Chance-Constrained Programs with Finite Support
Standard Big-M mixed-integer programming reformulations of chance-constrained programs (CCPs) with finite support often yield weak linear relaxations and scale poorly as the number of scenarios increases. To address this limitation, we derive two families of intersection cuts from problem-specific S
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Complexity of Integer Programming in Reverse Convex Sets via Boundary Hyperplane Cover#1082916
- Surrogate-Based Autotuning for Randomized Sketching Algorithms in Regression Problems#983431
- ADMM and Linearized ADMM for Weakly Convex Minimization#1000133
- Maximum Strong Independent Sets in Hypergraphs: Reductions, Bounds, and Greedy Certificates#1011663
- Random algebraic constructions for extremal and Ramsey problems#1052031
Record · ID 1119019
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive