Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Networks 75.3 (2020): S. 235-258.
- Event
-
Veröffentlichung
- (where)
-
Erlangen
- (who)
-
Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
- (when)
-
2020
- Creator
- DOI
-
10.1002/net.21922
- URN
-
urn:nbn:de:bvb:29-opus4-153625
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:54 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Rebennack, Steffen
- Prokopyev, Oleg A.
- Singh, Bismark
- Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
Time of origin
- 2020
Other Objects (12)
The complexity of local max-cut
The complexity of local Max-Cut
Risk-Averse Two-Stage Stochastic LinearProgramming: Modeling and Decomposition
Two-stage stochastic semidefinite programming and decomposition based interior point methods
Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse
Some Complexity Results for k-Cardinality Minimum Cut Problems
Understanding planning tasks : domain complexity and heuristic decomposition
A branch-and-cut approach and alternative formulations for thetraveling salesman problem with drone
Singular value decomposition versus sparse grids: Refined complexity estimates
Normed processes, unique decomposition, and complexity of bisimulation equivalences
Decomposition-based interior point methods for two-stage stochastic convex quadratic programs with recourse
Refined cut selection for benders decomposition: applied to network capacity expansion problems
The complexity of local max-cut
The complexity of local Max-Cut
Risk-Averse Two-Stage Stochastic LinearProgramming: Modeling and Decomposition
Two-stage stochastic semidefinite programming and decomposition based interior point methods
Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse
Some Complexity Results for k-Cardinality Minimum Cut Problems
Understanding planning tasks : domain complexity and heuristic decomposition
A branch-and-cut approach and alternative formulations for thetraveling salesman problem with drone
Singular value decomposition versus sparse grids: Refined complexity estimates
Normed processes, unique decomposition, and complexity of bisimulation equivalences
Decomposition-based interior point methods for two-stage stochastic convex quadratic programs with recourse
Refined cut selection for benders decomposition: applied to network capacity expansion problems
The complexity of local max-cut
The complexity of local Max-Cut
Risk-Averse Two-Stage Stochastic LinearProgramming: Modeling and Decomposition
Two-stage stochastic semidefinite programming and decomposition based interior point methods
Disjunctive decomposition for two-stage stochastic mixed-binary programs with random recourse
Some Complexity Results for k-Cardinality Minimum Cut Problems
Understanding planning tasks : domain complexity and heuristic decomposition
A branch-and-cut approach and alternative formulations for thetraveling salesman problem with drone
Singular value decomposition versus sparse grids: Refined complexity estimates
Normed processes, unique decomposition, and complexity of bisimulation equivalences
Decomposition-based interior point methods for two-stage stochastic convex quadratic programs with recourse