As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
One of the key unresolved challenges in Adjustable Robust Optimisation is how to deal with large discrete uncertainty sets. In this paper we present a technique for handling such sets based on symmetry breaking ideas from Constraint Programming. In earlier work we applied the technique to a pre-disaster planning problem modelled as a two-stage Stochastic Program, and we were able to solve exactly instances that were previously considered intractable and only had approximate solutions. In this paper we show that the technique can also be applied to an adjustable robust formulation that scales up to larger instances than the stochastic formulation. We also describe a new fast symmetry breaking heuristic that gives improved results.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.