Score-based discrete decision rules for contextual constrained stochastic programming
From MaRDI portal
Cites work
- K-adaptability in two-stage robust binary programming
- A Hierarchy of Near-Optimal Policies for Multistage Adaptive Optimization
- A Linear Decision-Based Approximation Approach to Stochastic Programming
- A manifold two-sample test study: integral probability metric with neural networks
- A note on bounds for VC dimensions
- A Sample Approximation Approach for Optimization with Probabilistic Constraints
- A survey of contextual optimization methods for decision-making under uncertainty
- Adjustable robust solutions of uncertain linear programs
- Binary decision rules for multistage adaptive mixed-integer optimization
- Data-Driven Optimization: A Reproducing Kernel Hilbert Space Approach
- Design of near optimal decision rules in multistage adaptive mixed-integer optimization
- Discontinuous Optimization by Smoothing
- Error bounds for approximations with deep ReLU networks
- Finite Adaptability in Multistage Linear Optimization
- Foundations of machine learning
- Generalized decision rule approximations for stochastic programming via liftings
- Introduction to stochastic programming.
- Lectures on stochastic programming. Modeling and theory
- Nonparametric regression on low-dimensional manifolds using deep ReLU networks: function approximation and statistical recovery
- On decision rules in stochastic programming
- Piecewise affine decision rules for contextual chance-constrained stochastic programming
- Risk-adaptive local decision rules
- The big data newsvendor: practical insights from machine learning
- Understanding machine learning. From theory to algorithms
This page was built for publication: Score-based discrete decision rules for contextual constrained stochastic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7327311)
