View the program in our Progressive Web App
Program for stream Discrete and Integer Optimization
Wednesday
Wednesday, 11:00-12:40
WB-12: Algorithmic Approaches for Scheduling and Ordering Problems
Stream: Discrete and Integer Optimization
Room: ZEU/146/Z
Chair(s):
Andreas Linß
-
Exact and Heuristic Approaches for the Weighted Linear Ordering Problem
Tobias Lechner, Jessica Hautz, Kerstin Maier, Peter Rescher -
Linear-time approximation algorithms for minimum subset sum and subset sum
Liliana Grigoriu -
Optimal Student Sectioning at Niederrhein University of Applied Sciences
Steffen Goebbels, Timo Pfeiffer -
A branch-and-price algorithm for job shop scheduling with flexible energy prices and time windows
Andreas Linß, Andreas Bley
WB-15: MIP and MINLP Techniques and Solvers
Stream: Discrete and Integer Optimization
Room: ZEU/160/H
Chair(s):
Tristan Gally
-
Designing hashing mechanisms for fast two-row and two-column reductions in mixed-integer presolve
Patrick Gemander, Wei-Kun Chen, Ambros Gleixner, Robert Lion Gottwald, Alexander Martin, Dieter Weninger -
Applicability of a PADM heuristic and an exact Decomposition Branching approach for MIPs with block structure
Katrin Halbig, Dieter Weninger, Alexander Martin -
A Computational Study Of Perspective Cuts
Ksenia Bestuzheva, Ambros Gleixner, Stefan Vigerske -
What’s new in the Xpress Solvers
Tristan Gally
Wednesday, 14:00-15:40
WC-15: Real-World Applications of Location and Assignment Problems
Stream: Discrete and Integer Optimization
Room: ZEU/160/H
Chair(s):
Arne Schulz
-
Algorithm to compute an upper bound for the competitive facility location problem with prescribed choice of suppliers
Andrey Melnikov, Vladimir Beresnev -
Optimized Resource Allocation and Task Offload Orchestration for SLA-Aware Service-Oriented Networks
Betül Ahat, Necati Aras, I. Kuban Altinel -
A balanced assignment problem
Arne Schulz
Wednesday, 16:10-17:25
WD-15: Results and Algorithms for Bin Packing Problems
Stream: Discrete and Integer Optimization
Room: ZEU/160/H
Chair(s):
Nils-Hassan Quttineh
-
An Asymptotic Heuristic for the Two-Dimensional Bin Packing Problem
Torsten Buchwald, Guntram Scheithauer -
A Stochastic Bin Packing Approach for Server Consolidation with Conflicts
John Martinovic, Markus Hähnel, Guntram Scheithauer, Waltenegus Dargie -
Modeling of a rich bin packing problem from industry
Nils-Hassan Quttineh
Thursday
Thursday, 9:00-10:40
TA-01: Algorithmic Advances for Discrete Optimization Problems
Stream: Discrete and Integer Optimization
Room: POT/006/H
Chair(s):
Sven Mallach
-
Adaptation of a Branching Algorithm to Solve Discrete Optimization Problems
Maialen Murua, Diego Galar, Roberto Santana -
Dynamic Programming for Combinatorial Optimization: A Primal-Dual Approach Based on Decision Diagrams
Michael Römer, Andre Augusto Cire, Louis-Martin Rousseau -
Combining Column Generation and Outer-Approximation for Solving Nonconvex MINLPs
Ivo Nowak, Pavlo Muts -
On Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization
Sven Mallach, Michael Juenger
TA-15: Algorithmic Approaches for TSP and Routing Problems
Stream: Discrete and Integer Optimization
Room: ZEU/160/H
Chair(s):
Stefan Irnich
-
On the Hamiltonian decomposition and the 1-skeleton of the traveling salesperson polytope
Andrei Nikolaev, Anna Kozlova -
Solving the Multiple Traveling Salesperson Problem on Regular Grids in Linear Time
Lisa Knoblinger, Philipp Hungerländer, Anna Jellen, Stefan Jessenitschnig, Manuel Lackenbucher, Kerstin Maier -
A branch-and-cut algorithm for the soft-clustered vehicle routing problem
Katrin Heßler, Stefan Irnich -
Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem
Stefan Irnich, Timo Hintsch, Lone Kiilerich
Thursday, 14:15-15:30
TD-15: Polyhedral Studies: Results and Applications
Stream: Discrete and Integer Optimization
Room: ZEU/160/H
Chair(s):
Daniel Schmidt
-
Flow-based extended formulations for feasible traffic light controls
Maximilian Merkert, Gennadiy Averkov, Do Duc Le, Sebastian Sager -
Classifying partition based Chvátal-Gomory cuts for the Steiner tree problem
Daniel Schmidt, Daniela Gaul
Thursday, 15:45-17:00
TE-15: Results and Algorithms for Layout Problems
Stream: Discrete and Integer Optimization
Room: ZEU/160/H
Chair(s):
Anja Fischer
-
Layout problems with reachability constraint
Michael Stiglmayr -
An extended polyhedral study of the betweenness model
Frank Fischer, Anja Fischer -
Solving extended row layout problems
Anja Fischer, Mirko Dahlbeck, Frank Fischer
Friday
Friday, 9:00-10:40
FA-15: Advances in Linear and Integer Programming
Stream: Discrete and Integer Optimization
Room: ZEU/160/H
Chair(s):
Stefan Ruzika
-
Strong IP Formulations Need Large Coefficients
Christopher Hojny -
A Dissection of the Duality Gap of Set Covering Problems.
Uledi Ngulo, Torbjörn Larsson, Nils-Hassan Quttineh -
Computing Prices in Product-Mix Auctions with Strong Substitutes
Maximilian Fichtl, Martin Bichler -
An FPTAS for a General Class of Parametric Optimization Problems
Stefan Ruzika, Arne Herzel, Cristina Bazgan, Clemens Thielen, Daniel Vanderpooten