Two‐stage stochastic minimum <i>s</i> − <i>t</i> cut problems: Formulations, complexity and decomposition algorithms (Q6087397)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms |
scientific article; zbMATH DE number 7765760
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two‐stage stochastic minimum <i>s</i> − <i>t</i> cut problems: Formulations, complexity and decomposition algorithms |
scientific article; zbMATH DE number 7765760 |
Statements
Two‐stage stochastic minimum <i>s</i> − <i>t</i> cut problems: Formulations, complexity and decomposition algorithms (English)
0 references
15 November 2023
0 references
Benders decomposition
0 references
combinatorial optimization
0 references
complexity
0 references
minimum \(s - t\) cut problem
0 references
total unimodularity
0 references
two-stage stochastic programming
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.8028059005737305
0 references
0.7773786783218384
0 references
0.7764595746994019
0 references
0.7724402546882629
0 references
0.7716106176376343
0 references
