Robustness and stability in constraint programming under dynamism and uncertainty
From MaRDI portal
Recommendations
- Robust satisfiability of constraint satisfaction problems
- Robustness analysis of stochastic programs with joint probabilistic constraints
- Robustness in stochastic programs with risk constraints
- Confidence-based reasoning in stochastic constraint programming
- Stability analysis for probabilistic constrained programs
- Constraint solving in uncertain and dynamic environments: A survey
Cited in
(11)- Nature-inspired techniques for dynamic constraint satisfaction problems
- Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem
- Combining local search and constraint propagation to find a minimal change solution for a dynamic CSP
- Branching constraint satisfaction problems for solutions robust under likely changes
- Dynamic bundling: Less effort for more solutions
- Reformulation based MaxSat robustness
- Modeling robustness in CSPs as weighted CSPs
- Robust Solutions in Unstable Optimization Problems
- Hybrid search for minimal perturbation in dynamic CSPs
- Constraint solving in uncertain and dynamic environments: A survey
- Confidence-based reasoning in stochastic constraint programming
This page was built for publication: Robustness and stability in constraint programming under dynamism and uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2874430)