Filtering algorithms for global chance constraints
type: Item
instance of: scholarly article
title: Filtering algorithms for global chance constraints
zbMATH Open document ID: 1251.68203
author: Brahim Hnich
author: Roberto Rossi
author: S. Armagan Tarim
author: Steven Prestwich
published in: Artificial Intelligence
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68T37
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 6106694
zbMATH Keywords: stochastic constraint programming
zbMATH Keywords: stochastic constraint satisfaction
zbMATH Keywords: global chance constraints
zbMATH Keywords: filtering algorithms
zbMATH Keywords: stochastic alldifferent
describes a project that uses: Choco
describes a project that uses: MINION
MaRDI profile type: Publication
full work available at URL: j.artint.2012.05.001
OpenAlex ID: W2143313502
Wikidata QID: Q57539203
cites work: Q4475621
cites work: The complexity of reasoning with global constraints
cites work: Introduction to Stochastic Programming
cites work: Deterministic Equivalents for Optimizing and Satisficing under Chance Constraints
cites work: Constraint satisfaction problems: convexity makes AllDifferent constraints tractable
cites work: A Survey on CP-AI-OR Hybrids for Decision Making Under Uncertainty
cites work: Q5726065
cites work: Simultaneous matchings: Hardness and approximation
cites work: Stochastic Constraint Programming by Neuroevolution with Filtering
cites work: Constraint-based local search for inventory control under stochastic demand and lead time
cites work: A global chance-constraint for stochastic inventory systems under service level constraints
cites work: Stochastic constraint programming: A scenario-based approach
cites work: Q4197160
DOI: 10.1016/J.ARTINT.2012.05.001
description: scientific article; zbMATH DE number 6106694