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

We introduce the two‐stage stochastic minimum s − t cut problem. Based on a classical linear 0‐1 programming model for the deterministic minimum s − t cut problem, we provide a mathematical programming formulation for the proposed stochastic extension. We show that its constraint matrix loses the to...

Full description

Bibliographic Details

Published in:	Networks Vol. 75; no. 3; pp. 235 - 258
Main Authors:	Rebennack, Steffen, Prokopyev, Oleg A., Singh, Bismark
Format:	Journal Article
Language:	English
Published:	Hoboken, USA John Wiley & Sons, Inc 01.04.2020 Wiley Subscription Services, Inc
Subjects:	Algorithms Benders decomposition combinatorial optimization complexity Decomposition Mathematical analysis Mathematical programming Matrix methods minimum s − t cut problem total unimodularity two‐stage stochastic programming
ISSN:	0028-3045, 1097-0037
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!