Two-stage stochastic minimum s - t cut problems: Formulations, complexity and decomposition algorithms.
Steffen RebennackOleg A. ProkopyevBismark SinghPublished in: Networks (2020)
Keyphrases
- computational complexity
- optimization problems
- benchmark problems
- related problems
- approximate solutions
- difficult problems
- worst case
- test problems
- computational issues
- optimization approaches
- computational cost
- optimization methods
- theoretical analysis
- computational problems
- complexity bounds
- combinatorial optimization
- decomposition methods
- problems in computer vision
- practical problems
- learning algorithm
- complexity analysis
- run times
- data mining
- search methods
- np hard
- search algorithm
- data structure
- partial solutions
- exact algorithms
- stochastic optimization
- computational geometry
- np complete
- multi objective
- convex optimization problems
- fixed parameter tractable