Program for stream Discrete and Combinatorial Optimization

WB-02: Robust Optimization
Stream: Discrete and Combinatorial Optimization
Room: H4
Chair(s): Michael Hartisch

• Fast scenario addition for two-stage robust mixed-integer programs
  Johannes Kager, Marc Goerigk, Dorothee Henke, Fabian Schäfer, Clemens Thielen
• Approximating Robust Problems by Uncertainty Sets
  Marc Goerigk, André Chassein, Jamie Fairbrother
• Scenario reduction for distributionally robust optimization
  Kevin-Martin Aigner, Sebastian Denzler, Frauke Liers, Sebastian Pokutta, Kartikey Sharma
• An Expansion-Based Approach for Multistage Robust Discrete Linear Programs
  Michael Hartisch

WB-04: Network Optimization
Stream: Discrete and Combinatorial Optimization
Room: H6
Chair(s): Arie Koster

• On Solving the Stochastic Steiner Tree Problem with a Fast Heuristic
  Berend Markhorst, Alessandro Zocca, Joost Berkhout, Rob van der Mei
• Analyzing Subtour Elimination Strategies for the Travelling Salesman Problem using Branch-and-Cut
  Tobias Klein, Kathrin Fischer
• Comparing Branching Rules for the Quota Steiner Tree Problem with Interference
  Jaap Pedersen, Niels Lindner, Daniel Rehfeldt, Thorsten Koch
• Sparse Solutions for Network Optimization Problems
  Arie Koster, Pauline Lückemann

WC-02: Bilevel Optimization
Stream: Discrete and Combinatorial Optimization
Room: H4
Chair(s): Arie Koster

• Solving the Partial Inverse Knapsack Problem
  Nikolas Lykourinos, Andreas M. Tillmann, Maximilian Merkert, Eva Ley
• On the Complexity of the Bilevel Shortest Path Problem
  Dorothee Henke, Lasse Wulf
• Neighbourhood-constrained Bilevel Shortest Path Problem
  Szymon Wróbel, Adam Kasperski, Pawel Zielinski
• Automated Logic-Based Benders Decomposition
  Vladimir Stadnichuk, Grit Walther, Arie Koster

WE-02: Decomposition Methods & Robust Optimization
Stream: Discrete and Combinatorial Optimization
Room: H4
Chair(s): Oliver Gaul

• A Branch-and-Cut Approach for Decision-Dependent Robust Optimization Problems
  Simon Stevens, Henri Lefebvre, Martin Schmidt, Johannes Thürauf
• Combining Benders Decomposition and Column Generation for Optimal Box Selection
  Pia Schreynemackers
• A Comprehensive Approach to Solving Large-Scale Security-Constrained Optimal Transmission Switching Problems
  Tim Donkiewicz, Oliver Gaul
• Efficiently Solving Benders Subproblems for the Security-Constrained Optimal Transmission Switching Problem with Substation Reconfiguration
  Oliver Gaul, Tim Donkiewicz

TA-02: Combinatorial Optimization
Stream: Discrete and Combinatorial Optimization
Room: H4
Chair(s): Sven Krumke

• On a Generalization of the Maximum Weighted Independent Set Problem
  Hannah Borgmann, Sven Krumke, Luis Paquete
• Polynomially Solvable Cases of the Quadratic Binary Optimization Problem with a Fixed Cardinality Constraint
  Thi Thanh Tu Le, Thorsten Koch
• Investment Guarantees for Inner Approximations
  Sven de Vries, Stephen Raach, Rakesh V. Vohra
• On the Complexity of Graph-Theoretic Versions of Partial Scenario Set Cover
  Shai Dimant, Sven Krumke

TC-02: Integer Programming I
Stream: Discrete and Combinatorial Optimization
Room: H4
Chair(s): Thorsten Koch

• Computational Aspects of Lifted Cover Inequalities for Knapsacks with Few Different Weights
  Cédric Roy, Christopher Hojny
• Column generation for a two-dimensional multi-criteria bin packing problem
  Christof Groschke, Steffen Goebbels, Jochen Rethmann
• An analysis of (mixed-)integer linear programming formulations for the Maximally Diverse Grouping Problem
  Arne Schulz
• A GPU accelerated variant of Schroeppel-Shamir's algorithm for solving the market split problem
  Thorsten Koch, Nils-Christian Kempke

TD-02: Integer Programming II
Stream: Discrete and Combinatorial Optimization
Room: H4
Chair(s): Sven Mallach

• Introducing clause-cuts to speed up MaxSAT problems in mixed integer linear programming
  Max Engelhardt, Milan Adhikari, Jonasz Staszek, Alexander Martin
• Mixed-Integer Linear Programming Models for the Planar p-Median Problem: An Evaluation of Different Linear Approximation Techniques of Euclidean Distances
  Fabian Wilschewski, Alf Kimms, Christin Münch
• A Lagrangian Decomposition Approach with Heuristic Search for Multi-Agent Path Planning in Moving Target Environments
  Wataru Murata
• Integer Programming Formulations for the Target Visitation Problem - Revisited
  Sven Mallach

FA-02: Scheduling & Packing
Stream: Discrete and Combinatorial Optimization
Room: H4
Chair(s): Sigrid Knust

• Multi-objective optimisation of the Hearing Scheduling Problem in the Court of Law
  Ieke Schrader, Erwin W. Hans, Marco Schutten
• Friends, Not Enemies: Exploring Synergy Types Between Complementary MIP Models for Large-Scale Instances with an Application to RCPSP
  Mohamed Ibrahim, Taieb Mellouli
• Heuristics for Variable Cost and Size Cluster Vector Bin Packing (VCSCVBP)
  Laura Wolf, Sabrina Klos, Stefan Nickel
• Scheduling sports tournaments with two court types
  Melissa Koch, Sigrid Knust, Xuan Thanh Le