Finding reliable solutions: event-driven probabilistic constraint programming
type: Item
instance of: scholarly article
title: Finding reliable solutions: event-driven probabilistic constraint programming
zbMATH Open document ID: 1181.90208
author: S. Armagan Tarim
author: Brahim Hnich
author: Steven Prestwich
author: Roberto Rossi
published in: Annals of Operations Research
publication date: 2010-02-01T00:00:00Z
full work available at URL: edpcp.pdf
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 5665076
MaRDI profile type: Publication
OpenAlex ID: W2111292628
Wikidata QID: Q57539225
cites work: Q3624051
cites work: Introduction to Stochastic Programming
cites work: Soft constraint logic programming and generalized shortest path problems
cites work: Chance-constrained programming
cites work: Q3410593
cites work: Q4253836
cites work: Project scheduling under uncertainty: survey and research potentials
cites work: Algorithms for hybrid MILP/CP models for a class of optimization problems
cites work: Q5726065
cites work: Q4309474
cites work: Depedent-chance programming: A class of stochastic optimization
cites work: Modelling stochastic decision systems using dependent-chance programming
cites work: A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
cites work: Q5678665
cites work: Stochastic constraint programming: A scenario-based approach
DOI: 10.1007/S10479-008-0382-6
description: scientific article; zbMATH DE number 5665076