Program

WA-01: Opening
Stream: Plenaries
Room: C V VI
Chair(s): Tibor Illés

WB-01: Plenary I
Stream: Plenaries
Room: C V VI
Chair(s): Tibor Illés

• Distributionally robust linear quadratic control
  Daniel Kuhn

WC-02: Algorithms
Stream: Game theory
Room: C 103
Chair(s): Giancarlo Bigi

• A new nucleolus-like method to compute the priority vector of a pairwise comparison matrix
  David Bartl
• Optimization framework of a two-sided auction based logistical coordination platform
  Márton Benedek, Kolos Ágoston
• Projected solutions for quasi-equilibria
  Giancarlo Bigi

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

WC-04: Large scale optimization and applications 1
Stream: Large scale optimization and applications
Room: C105
Chair(s): Nataša Krklec Jerinkić

• Spectral Stochastic Gradient Method with Additional Sampling for Finite and Infinite Sums
  Nataša Krklec Jerinkić, Valeria Ruggiero, Ilaria Trombini
• A Simple Stochastic Trust-Region Method for Training Neural Network Classification Models
  Mahsa Yousefi, Stefania Bellavia, Benedetta Morini
• Neural Network Models for Eigenvalue Problems
  Marko Hajba, Luka Grubisic

WD-02: Applications
Stream: Game theory
Room: C 103
Chair(s): Attila Tasnádi

• Limitations of the MedRank algorithm
  Attila Tasnádi
• Voting power in the Council of the European Union: A sensitivity analysis
  Laszlo Csato, Dora Greta Petroczy
• Convergence of a Two-Player Version of Macqueen's k-means Algorithm
  Stéphan Sémirat

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

WD-04: Large scale optimization and applications 2
Stream: Large scale optimization and applications
Room: C105
Chair(s): Greta Malaspina

• Probabilistic Trust Region Method for solving Multi-Objective Problems
  Luka Rutešić, Natasa Krejic, Nataša Krklec Jerinkić
• Evolving relocation rules for the Container Relocation Problem using Genetic programming
  Mateja Đumić
• Randomized Gauss-Newton methods for large scale nonlinear least squares
  Greta Malaspina, Stefania Bellavia, Benedetta Morini

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

WE-03: Interior-Point Methods for Linear Complementarity Problems I
Stream: Advances in theory and practice of interior-point methods
Room: C 104
Chair(s): Petra Renáta Rigó

• New class of algebraically equivalent transformations for predictor-corrector interior-point algorithms
  Petra Renáta Rigó, Tibor Illés, Roland Török
• Implementation of predictor-corrector interior-point algorithms for sufficient linear complementarity problems
  Roland Török, Tibor Illés, Petra Renáta Rigó
• New class of algebraically equivalent transformations for predictor-corrector algorithms solving symmetric cone horizontal linear complementarity problems
  Zsolt Darvay, Petra Renáta Rigó

WE-04: P-graph Algorithms
Stream: P-graph algorithms and applications
Room: C105
Chair(s): Marton Frits

• Direct Calculation: A Novel P-graph Based Method for Determining Reliability
  Mihály István Sümegi, Ákos Orosz
• Extension of P-graph Framework to Simultaneously Cover Directed and Nondirected Elements
  Ákos Orosz, Ferenc Friedler
• Combining the multi-periodic and flexible input modeling techniques in the P-Graph framework
  András Éles, István Heckl

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

WF-03: Interior-Point Methods for Linear Complementarity Problems II
Stream: Advances in theory and practice of interior-point methods
Room: C 104
Chair(s): Anita Varga

• Bounding the handicap of a matrix
  Marianna E.-Nagy, Tibor Illés, Laszlo Vegh
• An Ai-Zhang-type interior-point framework for linear complementarity problems
  Anita Varga, Marianna E.-Nagy
• Simplified Analysis of Kernel-Based Interior-Point Methods for Linear Complementarity Problems
  Goran Lesaja, Zsolt Darvay, Marianna E.-Nagy, Petra Renáta Rigó, Anita Varga

WF-04: P-graph Applications I.
Stream: P-graph algorithms and applications
Room: C105
Chair(s): Zsolt Ercsey

• Optimal Trajectory and Route Planning for Free Navigation of Automated Guided Vehicles
  Marton Frits, Botond Bertok
• Learning Path Optimization by P-graph Algorithms for Curriculum Development in Higher Education
  Anikó Zseni, Botond Bertok, András Horváth, Zsolt Kovács
• Comparison of PNS and TCPNS formulations of production scheduling for furniture manufacturing
  Károly Kalauz, Botond Bertok, Marton Frits

TA-01: Plenary II
Stream: Plenaries
Room: C V VI
Chair(s): Botond Bertok

• Linear programming bounds for problems in discrete geometry
  Mate Matolcsi

TB-02: Strategic games
Stream: Game theory
Room: C 103
Chair(s): Miklós Pintér

• Value-Positivity for Matrix Games
  Raimundo Saona
• Continuous generalized games
  Imre Balog, Miklós Pintér
• Games with partial control
  Miklós Pintér

TB-03: Topics in nonlinear programming
Stream: contributed papers
Room: C 104
Chair(s): Sándor Bozóki

• Convergence of semi-convex functions in CAT(1) spaces and refelction on Douglas Rachford Operator Splitting Algorithm
  Hedvig Gal, Miklós Pálfia
• Different types of feasibility problems via special membership functions
  József Dombi
• Homogeneous convex polyhedra with one unstable equilibrium have at least 7 vertices
  Sándor Bozóki, David Papp, Krisztina Regős, Gábor Domokos

TB-04: Modeling, Simulation and Optimization
Stream: Large scale optimization and applications
Room: C105
Chair(s): Kristian Sabo

• Solving sequences of parametrized Lyapunov equations for efficient simulation of parameter influence
  Zoran Tomljanovic
• A two diffusions stochastic model for epidemic of the SARS-CoV-2 virus
  Ivan Papić, Nenad Šuvak, Jasmina Đorđević
• Nonlinear distributed estimation in correlated heavy-tailed noise
  Manojlo Vukovic, Dusan Jakovetic, Dragana Bajovic, Soummya Kar

TC-02: Allocations
Stream: Game theory
Room: C 103
Chair(s): Péter Csóka

• An Axiomatization of the Pairwise Netting Proportional Rule in Financial Networks
  Péter Csóka, P. Jean-Jacques Herings
• TU-games with utility: characterization sets for the u-prenucleolus
  Zsófia Dornai, Miklós Pintér
• Nucleolus-type allocations in hierarchies when cooperation is costly
  Tamás Solymosi

TC-03: Approximation algorithms for graph problems
Stream: Approximation algorithms
Room: C 104
Chair(s): Gyula Pap

• On the Complexity of Finding Maximum Size Properly Colored Trees and Forests in Edge-Colored Graphs
  Gergely Csáji, Yuhang Bai, Kristof Berczi, Tamás Schwarcz
• Color-avoiding connected spanning subgraphs with minimum number of edges
  Kitti Varga
• Approximation of disjoint A-paths via fractional matroid matching
  Gyula Pap

TC-04: P-graph Applications II.
Stream: P-graph algorithms and applications
Room: C105
Chair(s): Botond Bertok

• Innovations in Public Service Process Management: Enhancing University Enrollment Through P-Graph Methodology
  Boglárka Eisinger Balassa, László Buics
• Process Network Solution of a Sport Shooting Event Scheduling Problem
  Zsolt Ercsey, Zoltán Kovács, Tamás Storcz

TD-02: Conic and polynomial optimization
Stream: Conic and polynomial optimization
Room: C 103
Chair(s): Miguel Anjos

• Shor convexity, min-max QCQPs and application to min-max regret of nonconvex QPs
  Immanuel Bomze, Paula Amaral
• Random Projections for Semidefinite Programming and Polynomial Optimization
  Monse Guedes Ayala, Pierre-Louis Poirion, Lars Schewe, Akiko Takeda
• Semidefinite liftings for the complex cut polytope
  Miguel Anjos, Lennart Sinjorgo, Renata Sotirov

TD-03: Stochastic optimization and applications I
Stream: Stochastic optimization and applications
Room: C 104
Chair(s): Csaba Fabian

• Improvements of the Q-compression method for constrained stochastic graph traversal problems
  Tamás Kegyes, Alex Kummer, Zoltán Süle, János Abonyi
• New algorithms for probability bounds with cherry trees
  Edith Kovács
• Applying random coordinate descent in a probability maximization scheme
  Edit Csizmás, Rajmund Drenyovszki, Tamas Szantai, Csaba Fabian

TD-04: Application of integer programming
Stream: contributed papers
Room: C105
Chair(s):

• Total Earliness-Tardiness problems for Coupled of Tasks scheduling
  Gábor Galambos, József Békési, Gyorgy Dosa
• A cost function approximation method for dynamic vehicle routing with LIFO and docking constraints
  Markó Horváth, Tamas Kis, Péter Györgyi
• Analysis of the Workload of Assembly Stations when the Makespan is Minimized in the Presence of Learning Effects
  Zakaria Zine El Abidine, Imre Dimény, Tamás Koltai

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

TE-03: Stochastic optimization and applications II
Stream: Stochastic optimization and applications
Room: C 104
Chair(s): Edit Csizmás

• Plant-wide master production scheduling in the automotive industry: A MILP-approach and a simulation study
  Achim Koberstein, Thorben Krüger
• Strategic Demand-Side Management: A Probability Maximization-Based Optimization Approach
  Rajmund Drenyovszki, Edit Csizmás, Tamas Szantai, Csaba Fabian

TE-04: OR applications
Stream: contributed papers
Room: C105
Chair(s): Zoltán Bánhidi

• Complex network approximate symmetries motivated by brain studies
  David Hartman, Anna Pidnebesna, Aneta Pokorna, Jaroslav Hlinka
• Quantifying the impact of outlier management techniques on digital country rankings
  Zoltán Bánhidi, Imre Dobos

FA-05: Plenary III
Stream: Plenaries
Room: E III
Chair(s): Marianna E.-Nagy

• Performance estimation of optimization methods: a guided tour
  François Glineur

FB-02: Decision theory
Stream: Decision theory
Room: C 103
Chair(s): Sándor Bozóki

• Estimating army effectiveness using pairwise comparison matrices
  Kristóf Ábele-Nagy
• Allocations based on pairwise comparisons
  Zsombor Szádoczki, Sándor Bozóki
• Aggregation of pairwise comparison matrices: A clustering approach
  Kolos Ágoston, Sándor Bozóki, Laszlo Csato

FB-03: Approximation algorithms for scheduling problems
Stream: Approximation algorithms
Room: C 104
Chair(s): Tamas Kis

• Analysis of an Approximation Algorithm for Coupled Task Scheduling with Equal Lengths of Tasks for Minimizing the Sum of Completion Times
  József Békési, Gyorgy Dosa, Gábor Galambos
• Improving bounds on approximation algorithms for the Triangle Scheduling problem using Mixed Integer Quadratic Programming
  Nóra Büki, János Balogh, József Békési, Gyorgy Dosa, Zsolt Tuza
• Joint replenishment meets scheduling
  Tamas Kis, Péter Györgyi, Timea Tamasi

FB-04: Methods of optimization
Stream: contributed papers
Room: C105
Chair(s): Mátyás Koniorczyk

• Graph cliques and quantum annealing
  Mátyás Koniorczyk, Kristóf Váradi, Sandor Szabo
• New interval-based training technique to parameter robustness
  Attila Szász, Balázs Bánhelyi
• Particle Filter Optimisation algorithms for robust optimisation
  Éva Kenyeres, Alex Kummer, János Abonyi

FC-05: Plenary IV
Stream: Plenaries
Room: E III
Chair(s): Giancarlo Bigi

• Decision rules for sequential decision-making under uncertainty
  Merve Bodur

FD-05: Closing
Stream: Plenaries
Room: E III
Chair(s): Tibor Illés