ESZA

Programme

Location

University of Szeged
Gyula Juhász Faculty of Education
6. Boldogasszony Ave
Szeged
Hungary
9. October (Thursday)
8.15 – 8.45 Registration
8.45 – 9.00 Welcome (Rector, Dean, Organizers)
Chair: Gábor Galambos
9.00 – 9.25 Tibor Illés: Optimization models for railway freight transportation
9.25 – 9.50 Andrej Brodnik: Waste wood recovery and reverse logistic
9.50 – 10.15 Silvano Martello: Heuristic and exact algorithms for the interval min-max regret knapsack problem
10.15 – 10.40 Bo Chen: Strong Stability of Nash Equilibria in Load Balancing Games
10.40 – 11.00 Coffee-break
Chair: Andrej Brodnik
11.00 – 11.25 Gabriel Istrate: Proof complexity and the Lovasz-Kneser Theorem
11.25 – 11.50 Andras Pluhar: Spanning Tree Game as Prim Would Have Played
11.50 – 12.15 Benedek Nagy: Fractal automata
12.15 – 14.00 Lunch
Chair: Silvano Martello
14.00 – 14.25 András Frank : Recent Applications of Supermodular Functions
14.25 – 14.50 Miklós Simonovits: Extremal graph theory and algorithms
14.50 – 15.15 András Recski: Duality in Graph Theory, in Matroid Theory and in Electric Network Theory
15.15 – 15.40 Attila Sali: Large Forbidden Cofigurations and Design Theory
15.40 – 16.00 Coffee-break
Chair: Bo Chen
16.00 – 16.25 Kim-Manuel Klein: A Robust AFPTAS for Online Bin Packing with Polynomial Migration
16.25 – 16.50 Rob van Stee: The optimal absolute ratio for online bin packing
16.50 – 17.15 Zsolt Tuza: Graph-Bin Packing
19.00 – Welcome Dinner
10. October (Friday)
Chair: Csanád Imreh
9.00 – 9.25 Karlo Bala: Simplified Simulated Annealing metaheuristic for the Capacitated Location Routing Problem
9.25 – 9.50 Dries Goossens: The Red-Blue Transportation Problem
9.50 – 10.15 Bogdan Zavalnij: On the auxiliary algorithm of coloring
10.15 – 10.40 Gerhard Reinelt: Ordering Problems
10.40 – 11.00 Coffee-break
Chair: Gerhard Reinelt
11.00 – 11.25 Hans Kellerer: A Best Possible Algorithm for Semi-Online Scheduling
11.25 – 11.50 Gyorgy Dosa: Scheduling two uniform machines with known optimum: tight results
11.50 – 12.15 Nysret Musliu: Automated Employee Scheduling
12.15 – 14.00 Lunch
Chair: András Recski
14.00 – 14.25 Franz Rendl: A projection hierarchy for some NP-hard optimization problems
14.25 – 14.50 Attila Kiss: 3-Dimensional VLSI Routing – Results and Open Problems in Discrete Optimization
14.50 – 15.15 Gyula O.H. Katona: Largest union-intersecting families
15.15 – 15.40 Sándor Szabó: Locating Low Rank Submatrices of a Matrix
15.40 – 16.00 Coffee-break
Chair: Miklós Krész
16.00 – 16.25 Csaba Raduly-Baka: The Modular Tool Switching Problem
16.25 – 16.50 Nebojša Gvozdenović: Distance matrix generation via linear load sampling
16.50 – 17.15 Csongor Csehi: Search for Hamiltonian Cycles, The Behaviour of the Sufficient Conditions
19.00 – Survivors' Dinner

The workshop is supported by the European Union and the European Social Fund through project Supercomputer, the national virtual lab (grant no.: TAMOP-4.2.2.C-11/1/KONV-2012-0010)