APA-Zitierstil (7. Ausg.)

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

Chicago-Zitierstil (17. Ausg.)

Rebennack, Steffen, Oleg A. Prokopyev, und Bismark Singh. "Two‐stage Stochastic Minimum S − t Cut Problems: Formulations, Complexity and Decomposition Algorithms." Networks 75, no. 3 (2020): 235-258. https://doi.org/10.1002/net.21922.

MLA-Zitierstil (9. Ausg.)

Rebennack, Steffen, et al. "Two‐stage Stochastic Minimum S − t Cut Problems: Formulations, Complexity and Decomposition Algorithms." Networks, vol. 75, no. 3, 2020, pp. 235-258, https://doi.org/10.1002/net.21922.