Program for stream Discrete and Combinatorial Optimization

WB-15: Discrete Optimization Problems I
Stream: Discrete and Combinatorial Optimization
Room: 10.50 HS 101
Chair(s): Christina Büsing

• Optimized Production Planning in Cable Manufacturing
  Sarah Drewes
• New lower bounds for the double row facility layout problem
  Frank Fischer, Anja Fischer, Angelika Wiegele
• The Effects of Closest Assignment Constraints on the Complexity of Capacitated Facility Location Problems
  Sophia Wrede, Christina Büsing, Timo Gersing
• Serving stochastically-departing customers: Near-optimal adaptive policies
  Danny Segev, Ali Aouad

WC-15: Discrete Optimization Problems II
Stream: Discrete and Combinatorial Optimization
Room: 10.50 HS 101
Chair(s): Imke Joormann

• Vehicle Routing with Heterogeneous Time Windows
  Tim Niemann, Petra Mutzel, Lukas Schürmann, Sebastian Stiller, Andreas M. Tillmann
• Aircraft fleet planning: An optimization approach integrating CO_2 trading systems
  Lisa-Marie Manke, Imke Joormann
• Separating setup and quantity decisions in stochastic lot sizing models
  Manuel Schlenkrich, Sophie Parragh

WE-03: Column Generation
Stream: Discrete and Combinatorial Optimization
Room: 30.95 Audimax B
Chair(s): Marco Lübbecke

• A Heuristic Column Generation Approach for the Stochastic Bin Packing Problem
  John Martinovic, Nico Strasdat, Jean-François Côté, Vinícius Loti de Lima
• Facilitating branch-and-price development and experiments
  Marco Lübbecke, Erik Mühmer
• (Strong) branching in branch-and-price
  Oliver Gaul, Erik Mühmer, Marco Lübbecke
• Branch-Price-and-Cut-Based Solution of the Order Batching Problem
  Julia Wahlen, Timo Gschwind

WE-15: Discrete Optimization Problems III
Stream: Discrete and Combinatorial Optimization
Room: 10.50 HS 101
Chair(s): Oliver Stein

• A Two-Dimensional Convex Shapes Bin Packing Problem in the Production of Laminated Safety Glass
  Steffen Goebbels, Thomas Lühring, Jochen Rethmann
• A Fast Asymptotic Heuristic for the Two-Dimensional Bin Packing Problem
  Torsten Buchwald, Guntram Scheithauer
• Optimal configurations for modular systems
  Maren Beck, Oliver Stein
• Branch-and-bound for bi-objective mixed integer programming
  Oryan Rampon, Sophie Parragh, Fabien Tricoire

TB-14: Robust and Bilevel Optimization I
Stream: Discrete and Combinatorial Optimization
Room: 10.50 Raum 702
Chair(s): Marc Goerigk

• Multi-Stage Adjustable Robust Optimization: New Tractable Policies and Approximation Bounds
  Simon Thomä, Grit Walther, Maximilian Schiffer
• Recycling Valid Inequalities for Robust Binary Optimization with Budget Uncertainty
  Timo Gersing, Arie Koster, Christina Büsing
• On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy
  Lasse Wulf, Marc Goerigk, Stefan Lendl
• A Penalty Branch-and-Bound Method for Mixed-Integer Quadratic Bilevel Problems
  Andreas Horländer, Martin Schmidt

TB-15: Discrete Optimization
Stream: Discrete and Combinatorial Optimization
Room: 10.50 HS 101
Chair(s): Sven Krumke

• Time Disjoint Paths
  Christoph Geis, Sven Krumke
• On the Complexity of Finding Short Branch-and-Bound Proofs
  Maximilian Gläser
• On the complexity of the robust shortest path and robust perfect b-matching problem under consistent arc constraints
  Sabrina Schmitz, Christina Büsing
• The traveling salesman problem with memory
  Anja Fischer

TC-14: Robust and Bilevel Optimization II
Stream: Discrete and Combinatorial Optimization
Room: 10.50 Raum 702
Chair(s): Marc Pfetsch

• Extensions of the Min-Max Regret Criterion for Combinatorial Optimization
  Marc Goerigk, Michael Hartisch, Werner Baak
• Improved Algorithms for Robust Combinatorial Optimization
  Mohammad Khosravi, Marc Goerigk
• Interdicting dense clusters in complex networks
  Foad Mahdavi Pajouh, Haonan Zhong, Sergiy Butenko, Oleg A. Prokopyev
• A novel Reformulation Technique for a Large Class of Bi-Level Network Design Problems
  Vladimir Stadnichuk, Maximilian Schiffer, Grit Walther

TC-15: Learning and Discrete Optimization
Stream: Discrete and Combinatorial Optimization
Room: 10.50 HS 101
Chair(s): Stefan Ruzika

• An ML-based algorithm selection method to solve the min cost flow problem
  Fabian von der Warth, Anna Meyer, Luca Schäfer, Philipp Herrmann, Stefan Ruzika
• Machine learning supported prediction of dual variables for the cutting stock problem with an application in stabilized column generation
  Sebastian Kraul, Markus Seizinger, Jens Brunner
• Using MILPs for generating robust adversarial examples
  Rónán Rian Carl Richter, Jörg Rambau
• Modeling and Exact Solution of Picker Routing and Order Batching Problems
  Stefan Irnich, Katrin Heßler

FA-14: MINLP
Stream: Discrete and Combinatorial Optimization
Room: 10.50 Raum 702
Chair(s): Sven Mallach

• Solving Mixed Integer Linear Programs (MILPs) Using Inside Ellipsoid Outside Sphere (IEOS) Model
  Mohammad Hesamzadeh
• Feasible rounding based diving strategies in branch-and-bound methods for mixed-integer optimization
  Stefan Schwarze, Christoph Neumann, Oliver Stein, Benjamin Müller
• PaMILO: A Solver for Multi-Objective Mixed Integer Linear Optimization and Beyond
  Levin Nemesch, Fritz Bökler, Mirko H. Wagner
• Inductive Linearization for BQPs with Linear Constraints - Computational Experience
  Sven Mallach