Decomposition-Based Solving Approaches for Stochastic Constraint Optimisation

Authors

  • David Hemmi Monash University; Data61

Keywords:

Stochastic Constraint Programming, Constraint Satisfaction

Abstract

Combinatorial optimisation problems often contain uncertainty that has to be taken into account to produce realistic solutions. A common way to describe the uncertainty is by means of scenarios, where each scenario describes different potential sets of problem parameters based on random distributions or historical data. While efficient algorithmic techniques exist for specific problem classes such as linear programs, there are very few approaches that can handle general Constraint Programming formulations subject to uncertainty. The goal of my PhD is to develop generic methods for solving stochastic combinatorial optimisation problems formulated in a Constraint Programming framework.

Downloads

Published

2018-04-29

How to Cite

Hemmi, D. (2018). Decomposition-Based Solving Approaches for Stochastic Constraint Optimisation. Proceedings of the AAAI Conference on Artificial Intelligence, 32(1). Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/11351