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...

Celý popis

Podrobná bibliografia

Vydané v:	Networks Ročník 75; číslo 3; s. 235 - 258
Hlavní autori:	Rebennack, Steffen, Prokopyev, Oleg A., Singh, Bismark
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Hoboken, USA John Wiley & Sons, Inc 01.04.2020 Wiley Subscription Services, Inc
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!