Program for stream Discrete Optimization

WC-03: Mixed Integer Programming I
Stream: Discrete Optimization
Room: C 104
Chair(s): Markó Horváth

• LP reformulation of combinatorial optimization problems aided by combinatorial methods
  Bogdan Zavalnij, Sandor Szabo
• Constraint Programming formulation for a real-world final exam scheduling problem with parallel sessions based on short time intervals
  László Kálmán Trautsch, Bence Kovari
• Maximal Hamming packing search: contact graph-based model MILP improvements
  Péter Naszvadi, Mátyás Koniorczyk

WD-03: Mixed Integer Programming II
Stream: Discrete Optimization
Room: C 104
Chair(s): Ambros Gleixner

• Complex geometrical test for optimality conditions in Interval Branch and Bound method
  Mihály Gencsi, Boglárka G.-Tóth
• Piecewise linear modeling of head-dependent hydropower function on non-grid triangulation
  Peter Dobrovoczki, Tamas Kis
• A proof system for certifying symmetry and optimality reasoning in integer programming
  Ambros Gleixner, Jasper van Doornmalen, Christopher Hojny, Leon Eifler

WE-02: Combinatorial Optimization I
Stream: Discrete Optimization
Room: C 103
Chair(s): Márton Benedek

• Passing the Limits of Pure Local Search for Weighted k-Set Packing
  Meike Neuwohner
• Optimizing schedules by the aspect of fairness
  Martin Rónai-Kovács, Szilvia Jáhn-Erdős

WF-02: Combinatorial Optimization II
Stream: Discrete Optimization
Room: C 103
Chair(s): Lilla Tothmeresz

• Problems on Group-labeled Matroid Bases
  Tamás Schwarcz, Florian Hörsch, András Imolay, Ryuhei Mizutani, Taihei Oki
• On the selection of an initial set of conditions for submodular function maximization for fully connected graph instances
  Eszter Csokas, Tamas Vinko
• Relationships between the geometry of graph polytopes and graph structure
  Lilla Tothmeresz, Tamas Kalman

TE-02: Network Optimization
Stream: Discrete Optimization
Room: C 103
Chair(s): Miklós Krész

• Directed k-way Cut and Sparsest Set in Bipartite Graphs
  Daniel Szabo, Tamás Király
• Heuristics for finding largest (k,l)-sparse subgraphs
  Péter Madarasi, Lóránt Matúz
• Approximation algorithm for the weighted connected p-median problem
  Miklós Krész, Murat Elhüseyni, Burak Kocuk