Filtering algorithms for global chance constraints
DOI10.1016/j.artint.2012.05.001zbMath1251.68203OpenAlexW2143313502WikidataQ57539203 ScholiaQ57539203MaRDI QIDQ1761302
Steven Prestwich, S. Armagan Tarim, Roberto Rossi, Brahim Hnich
Publication date: 15 November 2012
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2012.05.001
filtering algorithmsstochastic constraint programmingglobal chance constraintsstochastic alldifferentstochastic constraint satisfaction
Stochastic programming (90C15) Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (6)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Stochastic constraint programming: A scenario-based approach
- Simultaneous matchings: Hardness and approximation
- A global chance-constraint for stochastic inventory systems under service level constraints
- Constraint satisfaction problems: convexity makes AllDifferent constraints tractable
- The complexity of reasoning with global constraints
- Constraint-Based Local Search for Inventory Control Under Stochastic Demand and Lead Time
- A Survey on CP-AI-OR Hybrids for Decision Making Under Uncertainty
- Stochastic Constraint Programming by Neuroevolution with Filtering
- Introduction to Stochastic Programming
- Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
This page was built for publication: Filtering algorithms for global chance constraints