Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms

Rebennack S, Prokopyev OA, Singh B (2019)

Publication Type: Journal article, Original article

Publication year: 2019

Journal

Networks Wiley-Blackwell

Article Number: net.21922

DOI: 10.1002/net.21922

Authors with CRIS profile

Bismark Singh Economics - Discrete Optimization - Mathematics (EDOM)

Involved external institutions

Karlsruhe Institute of Technology (KIT) DE Germany (DE) University of Pittsburgh US United States (USA) (US)

How to cite

APA:

Rebennack, S., Prokopyev, O.A., & Singh, B. (2019). Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms. Networks. https://dx.doi.org/10.1002/net.21922

MLA:

Rebennack, Steffen, Oleg A. Prokopyev, and Bismark Singh. "Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms." Networks (2019).

BibTeX: Download