Value interchangeability in scenario generation

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Several types of symmetry have been identified and exploited in Constraint Programming, leading to large reductions in search time. We present a novel application of one such form of symmetry: detecting dynamic value interchangeability in the random variables of a 2-stage stochastic problem. We use a real-world problem from the literature: finding an optimal investment plan to strengthen a transportation network, given that a future earthquake probabilistically destroys links in the network. Detecting interchangeabilities enables us to bundle together many equivalent scenarios, drastically reducing the size of the problem and allowing the exact solution of cases previously considered intractable and solved only approximately. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Prestwich, S. D., Laumanns, M., & Kawas, B. (2013). Value interchangeability in scenario generation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8124 LNCS, pp. 587–595). https://doi.org/10.1007/978-3-642-40627-0_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free