A conflict-directed approach to chance-constrained mixed logical linear programming
From MaRDI portal
Publication:6080642
DOI10.1016/j.artint.2023.103972OpenAlexW4385275414MaRDI QIDQ6080642
Publication date: 4 October 2023
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2023.103972
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planning and acting in partially observable stochastic domains
- Decomposition algorithms for two-stage chance-constrained programs
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
- Stochastic constraint programming: A scenario-based approach
- Partitioning procedures for solving mixed-variables programming problems
- Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis
- Logic-based Benders decomposition
- Complexity estimates of some cutting plane methods based on the analytic barrier
- Distributionally robust joint chance constraints with second-order moment information
- Mixed logical-linear programming
- Optimized Bonferroni approximations of distributionally robust joint chance constraints
- On distributionally robust chance-constrained linear programs
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Generalized Benders decomposition
- Conflict-directed \(A^{*}\) and its role in model-based embedded systems
- Global Optimization with Polynomials and the Problem of Moments
- Chance-Constrained Programming
- Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
- Chance-Constrained Optimal Power Flow: Risk-Aware Network Control under Uncertainty
- From CVaR to Uncertainty Set: Implications in Joint Chance-Constrained Optimization
- The Cutting-Plane Method for Solving Convex Programs
- Generalized Conflict Learning for Hybrid Discrete/Linear Optimization
- A central cutting plane algorithm for the convex programming problem
- Dummy Endogenous Variables in a Simultaneous Equation System
- Chance-Constrained Programming with Joint Constraints
- Analyzing Infeasible Mixed-Integer and Integer Linear Programs
- Probabilistic Planning for Continuous Dynamic Systems under Bounded Risk
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Chance Constrained Programming with Joint Constraints
- Convex Approximations of Chance Constrained Programs
- Semidefinite Programming For Chance Constrained Optimization Over Semialgebraic Sets
- Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
This page was built for publication: A conflict-directed approach to chance-constrained mixed logical linear programming
