Stochastic Survivable Network Design Problems

Autor:	Bernd Zey, Petra Mutzel, Ivana Ljubić
Rok vydání:	2013
Předmět:	Network planning and design Mathematical optimization Stochastic integer programming Stochastic modelling Applied Mathematics Maximum cut Computation Discrete Mathematics and Combinatorics Benders' decomposition Orientation (graph theory) Branch and cut Algorithm Mathematics
Zdroj:	Electronic Notes in Discrete Mathematics. 41:245-252
ISSN:	1571-0653
DOI:	10.1016/j.endm.2013.05.099
Popis:	In this paper we introduce survivable network design problems under a two-stage stochastic model with fixed recourse and finitely many scenarios. We propose a new cut-based formulation based on orientation properties which is stronger than the undirected cut-based model. We use a two-stage branch&cut algorithm for solving the decomposed model to provable optimality. In order to accelerate the computations, we suggest a new cut strengthening technique for the decomposed L-shaped optimality cuts that is computationally fast and easy to implement.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::bd5e2d695feff0348a6275fe5508b2e1 https://doi.org/10.1016/j.endm.2013.05.099 Zobrazit plný text záznamu Full Text from ScienceDirect