Tim Donkiewicz

Benders Cut Filtering for Affine Potential-Based Flow Problems with Robustness Scenarios and Topology Switching

  • Tim Donkiewicz
  • Oliver Gaul
    • Categories (Mixed) Integer Linear Programming, Cutting Plane Approaches, Energy Tags , , , ,

    Many large-scale optimization problems decompose into a master problem and scenario subproblems, a structure that can be exploited by Benders decomposition. In Benders decomposition, each iteration may generate many cuts from scenario subproblems, and adding all of them as constraints then causes the master problem to grow rapidly. These are constraints that may need to … Read more

    Adaptive Subproblem Selection in Benders Decomposition for Survivable Network Design Problems

  • Tim Donkiewicz
    • Categories (Mixed) Integer Linear Programming, Branch and Cut Algorithms, Network Optimization

    Scenario-based optimization problems can be solved via Benders decomposition, which separates first-stage (master problem) decisions from second-stage (subproblem) recourse actions and iteratively refines the master problem with Benders cuts. In conventional Benders decomposition, all subproblems are solved at each iteration. For problems with many scenarios, solving only a selected subset can reduce computation. We quantify … Read more