Conference Program
Wednesday, June 10
Thursday, June 11
Friday, June 12
Wednesday, June 10
8:00-9:00 Registration
8:45-9:00 Opening
9:00-10:00 Plenary Session I
Chair: Tibor Illés
On the 70+ Years of Interior Point MethodsTamás Terlaky
10:00-11:00 Plenary Session II
Chair: Botond Bertok
Structural Approach to Designing Optimal Complex Processing Systems: P-graph FrameworkFerenc Friedler
11:00-11:30 Coffee Break
11:30-13:00 Parallel Session 1A: Interior-Point Algorithms
Chair: Anita Varga
An interior-point approach for risk-neutral and risk-averse multistage stochastic optimizationJordi Castro, Laureano F. Escudero, Juan Francisco Monge
Complexity analysis of Interior-Point Methods for P ∗ (κ)-LCPs based on Standard Kernel FunctionsGoran Lesaja, Zsolt Darvay, Marianna E.-Nagy, Petra Renáta Rigó, Anita Varga
Dual certificates of primal cone membershipAnita Varga, David Papp
11:30-13:00 Parallel Session 1B: Stochastic Programming in Memory of Tamas Szántai
Chair: Csaba Fabian
A stochastic model for the spread of epidemic via self-exiting point processesLászló Gerencsér, Gábor Szederkényi, Simon Oláh, Zsuzsanna Vágó
Parameter Estimation in Population Balance Models with Irregular Feasible RegionsDiana Wiederschitz, Edith Kovács, Botond SzilagyiRandom descent steps in a probability maximization schemeEdit Csizmás, Rajmund Drenyovszki, Tamas Szantai, Csaba Fabian
11:30-13:00 Parallel Session 1C: QUBOs and Quantum
Chair: Boglárka G.-Tóth
Augmented Lagrangian method for solving the sparsest k-subgraph problem as a QUBORoman Kuzel, Mátyás Koniorczyk, Janez Povh
A quantum-classical branch-and-bound algorithmAndrás Czégel, Boglárka G.-Tóth
Efficient computation of the classical bound of Bell correlation and prepare-and-measure witnessesIstván Márton
13:00-14:00 Lunch
14:00-16:00 Parallel Session 2A: Copositive Optimization
Chair: Immanuel Bomze
Completely positive reformulations for sparse quadratic optimizationMarkus Gabl, Bo Peng, Immanuel Bomze
Copositive approach to adjustable robust optimization with inexact decision rulesJohannes Zischg, Markus Gabl
Copositivity-informed relaxations of rigorous sparsity control in StQPs applied to microfinanceImmanuel Bomze, Paula Amaral, Bo Peng
Bounds and exact values of some domination parameters on cylindrical graphsJanez Žerovnik
14:00-16:00 Parallel Session 2B: Game Theory
Chair: Tamás Solymosi
Computing the least core for energy community gamesGiancarlo Bigi
Connecting Europe Through Hydrogen: Cost Allocation Analysis of Cross-Border Pipeline Coalition under Varying Subsidy PoliciesArthur Emmanuel Kwesi, Tamás Solymosi
Cooperative games with a-priori linksSurajit Borkotokey, Parishmita Boruah, Sujata Goala, Tamás Solymosi
Coalition formation and cost allocation in subsidized pipeline developmentsTamás Solymosi, Emmanuel Kwesi Arthur
14:00-16:00 Parallel Session 2C: Interval Branch & Bound and Scheduling
Chair: Tamás Storcz
Advanced geometrical test for optimality conditions in Interval Branch and Bound methodBoglárka G.-Tóth
An advanced Interval Branch and Bound Algorithm in the Julia Programming LanguageMihály Gencsi, Boglárka G.-Tóth
Application of a simple ALB model for the robotic assembly of an electronic deviseMáté Csíkos, Tamás Koltai
A human resource allocation problem considering time periods and uncertaintyTamás Storcz, Zsolt Ercsey, Nándor Vincze, Zoltán Kovács
16:00-16:15 Break
Chair: Georgina Hall
On the integration of LP folding into MosekErling Andersen
A Las-Vegas Pruned Cutting-Plane Method for Highly Constrained Convex OptimizationBalázs Miavecz, Balázs Csáji
From Trees to Treewidth: Inventory Management in Complex Supply Chain Networks through parametrized LPsGeorgina Hall, Andre Calmon, Philippe Blaettchen, Mohit Tawarmalani
SDP analysis of the worst-case convergence for the boosted DCAEtienne De Klerk, Hadi Abbaszadehpeivasti, Adrien Taylor
16:15-18:15 Parallel Session 3B: Stochastic Optimization in Machine Learning
Chair: Nataša Krklec Jerinkić
Learning-Based Estimation of Traveling Salesman Route Length
Andrea Rožnjik, Karlo Bala, Nebojša Gvozdenović, Dejan Brcanov
Heuristic Approaches for the Mothership–Drone Routing Problem with a Fixed Mothership RouteAstrid Wibowo, Boglárka G.-Tóth, József Békési
Nonmonotone Line Search and Additional Sampling in Penalty Methods for Nonlinear Equality-Constrained Finite SumsNemanja Vučićević, Natasa Krejic, Nataša Krklec Jerinkić, Tijana Ostojić
Adaptive heavy-ball-like stochastic gradient methods with reshuffling for unconstrained finite sum problemsNataša Krklec Jerinkić, Federica Porta, Simone Rebegoldi, Isidora Vuković
16:15-18:15 Parallel Session 3C: Scheduling, Packing, Covering
Chair: János Balogh
Comparison of heuristic solution methods for the Merge Scheduling ProblemMiklós Krész, Daniil Baldouski, Balazs David, Martin Milanic
Improved bounds for deterministic algorithms on semi-online scheduling with decreasing processing timesNóra Büki, János Balogh, József Békési
Tight Approximation Ratio of Algorithm SDF for UET Coupled Task Scheduling ProblemJózsef Békési, Gyorgy Dosa, Gábor Galambos
Tiling and covering squares with consecutive squares (70 is not enough)János Balogh, Jiri Sgall, József Békési, Gyorgy Dosa, Lars Magnus Hvattum, Zsolt Tuza
18:30-19:15 Caste Visit
Guided tour to the Mosonmagyaróvár Castle
19:30-21:30 Conference Banquette
Reception at the conference venue.
Thursday, June 11
8:00-9:00 Registration
9:00-10:00 EURO Plenary
Chair: Etienne De Klerk
Enforcing shape constraints using sum of squares polynomialsGeorgina Hall
10:00-11:00 HORS Plenary
Chair: Giancarlo Bigi
Separation theorem for nonlinear inverse images of convex setsZsolt Páles
11:00-11:30 Coffee Break
11:30-13:00 Parallel Session 4A: Convexity and its Generalizations
Chair: Tibor Kiss
Bernstein–Doetsch-type theorems for generalized convex functionsAttila Gilanyi, Zsolt Pales
From efficiency to stability: A new robustness measure for multiobjective LPMilan Hladík
Directional t-convexity in ordered normed spacesTibor Kiss
11:30-13:00 Parallel Session 4B: QUBOs and Quantum 2
Chair: Mátyás Koniorczyk
Mixed Hamming-packings for benchmarking QUBO solversPéter Naszvadi, Mátyás Koniorczyk, Marcell Tukora
QUBO formulations for minimizing breaks in sports timetablingViktória Nemkin, Levente Gegő
QUBO-solving heuristics based on physics: the perspective of simulated bifurcationMátyás Koniorczyk
11:30-13:00 Parallel Session 4C: Stochastic Programming in Memory of Tamas Szántai 2
Chair: Edith Kovács
Learning continuous Generalized Naïve Bayes from dataAbraham Papp, Botond Szilagyi, Edith Kovács
Probability Bounds via Hypergraph Structures: A Review of Joint Work with Tamás SzántaiJozsef Bukszar
The blooming of the Cherry TreesEdith Kovács
13:00-14:00 Lunch
14:00-16:00 Parallel Session 5A: Decision Theory
Chair: Kolos Ágoston
Geometric characterization of Pareto efficient weight vectors of 4x4 pairwise comparison matricesKristóf Ábele-Nagy, Zsombor Szádoczki, Sándor Bozóki
On a Special Property of Eigenvalue-Minimization-Based Completion of Incomplete Pairwise Comparison MatricesKolos Ágoston, Laszlo Csato, Sándor Bozóki
Problems regarding the geometry of Pareto efficient weight vectorsEmma Lukács, Kristóf Ábele-Nagy, Sándor Bozóki, Zsombor Szádoczki
The subsets of comparisons of complete pairwise comparison matrices with the same cardinality and the logarithmic least squares methodZsombor Szádoczki, Sándor Bozóki, Vitaliy Tsyganok
14:00-16:00 Parallel Session 5B: Neural Networks
Chair: Balázs Bánhelyi
Interval Based Verification of Adversarial Example Free Zones for Neural Networks: Dependency Problem RevisitedTibor Csendes
MORSE: a novel robust multi-objective regression method with genetic algorithm based variable selectionJános Gyula Kisházi, Tamás Kegyes, Tibor Dulai
Parameter Robustness Of Neural NetworksAttila Szász, Balázs Bánhelyi
Reliable Parking Trajectory Prediction with Verifiable Neural NetworksBalázs Bánhelyi, Nándor Vincze
14:00-16:00 Parallel Session 5C: Recent Progress in Convex Optimization
Chair: Zoltán Horváth
Semismooth Newton methods with global convergence ratesPavel Dvurechensky, Amal Alphonse, Ioannis Papadopoulos
Smoothing unadjusted Langevin algorithm for Kurdyka-{\L}ojasiewicz potential functionsSusan Ghaderi, Yves Moreau, Masoud Ahookhosh
Stochastic Three Points Method with an Inexact Oracle and Its Application to Steady-State OptimizationGeovani Grapiglia
Universal Complexity Bounds for Universal Gradient Methods in Nonlinear OptimizationYurii Nesterov
16:00-16:15 Break
16:15-17:45 HORS Award Ceremony and
Young Researcher Award Lectures
Chair: Boglárka G.-Tóth
Preallocation-based Combinatorial Auction for Efficient Fair Channel Assignments in Multi-Connectivity NetworksDávid Csercsik
A Simple 1.5-Approximation Algorithm for a Wide Range of Maximum-Size Stable Matching ProblemsGergely Csáji
16:15-17:45 Parallel Session 6B: Recent Progress in Convex Optimization 2
Chair: Nikita Doikov
Difference of high-order Moreau envelopes for DC optimizationAlireza Kabgani, Moslem Zamani, Masoud Ahookhosh
On Bregman–Moreau Envelope Reformulations of DC ProgramsMoslem Zamani
Gradient-Normalized Smoothness for Optimization with Approximate HessiansNikita Doikov
17:45-18:30 General Assembly of HORS (MOT Közgyűlés)
General Assembly of the Hungarian Operations Research Society.
18:00-18:45 Smart Garden visit (Group #1)
Guided tour to the Széchenyi University's medicinal and spice garden.
18:45-19:30 Smart Garden visit (Group #2)
Guided tour to the Széchenyi University's medicinal and spice garden.
Friday, June 12
9:00-10:00 Plenary Session III
Chair: Tamás Terlaky
Stochastic and derivative-free optimization with trust regionsSara Shashaani
10:00-10:30 Coffee Break
10:30-12:30 Parallel Session 7A: Routing
Chair: Gyorgy Dosa
Emergency rescue scheduling Gyorgy Dosa, János Balogh, József Békési, Nóra Büki, Lars Magnus Hvattum, Zsolt Tuza, Béla Vizvári
On the robust bilevel toll setting problemAndrás Kovács, Tamas Kis
Optimization of Municipal Waste Collection RoutesAndrás Éles, Olivér Ősz, Marton Frits, Ákos Orosz
Hypergraph representation of all matroidsÁron Jánosik
10:30-12:30 Parallel Session 7B: Recent Progress in Convex Optimization 3
Chair: Anton Rodomanov
Mirror descent with barriersYura Malitsky
Efficient Gradient Methods for Functions with Super-Quadratic CurvatureAnton Rodomanov, Nikita Doikov
Global convergence of scaled Polyak subgradient method for robust phase retrievalMorteza Rahimi, Masoud Ahookhosh
The General Linear Methods View of Monotone Gradient and Proximal OptimizationZoltán Horváth
10:30-12:30 Parallel Session 7C: P-graph Algorithms
Chair: Ákos Orosz
Algorithms for Identifying the Crucial Decisions and Generating Strategic N-best Process StructuresBertalan Kovács, Botond Bertok
Comprehensive model generation and solution method for chemical engineering process design including separation network synthesis and heat integration by P-graphsSzonja Sipos, Botond Bertok
Exploring Hybrid Quantum–Classical Methods for P-Graph OptimizationMarton Frits
Synthesis of Processing Systems with Various Reliability RequirementsÁkos Orosz, Zoltán Kovács, Ferenc Friedler
12:30-13:30 Lunch
Chair: Erika Bérczi-Kovács
13:30-15:00 Parallel Session 8A: Network OptimizationFixed-Parameter Tractability for Steiner Rooted Connected OrientationsKristof Berczi
Pearl: Perfectly 2-resilient Skipping Routing with Few Header Bits via Cut DecompositionBecsó Gergely
Optimizing Routing Availability Against Localized Disaster ScenariosErika Bérczi-Kovács
13:30-15:00 Parallel Session 8B: Interior-Point Algorithms 2
Chair: Zsolt Darvay
Interior-point algorithm based on a universal tangent directionPetra Renáta Rigó, Marianna E.-Nagy, Tibor Illés, Yurii Nesterov
Interior-point methods using two distinct classes of AET functionsZsolt Darvay, Petra Renáta Rigó
Parabolic Target-Space Interior-Point Algorithm for Weighted Monotone Linear Complementarity ProblemTibor Illés
13:30-15:00 Parallel Session 8C: P-graphs Applications
Chair: Marton Frits
A human resource allocation problem as a well solvable, k-wide l-hierarchical PNS problemMóric Váradi, Zsolt Ercsey, Tamás Storcz, Zoltán Kovács
A P-graph-based Exact Approach for Agile Project SchedulingTünde Tarczali, Marton Frits, Zoltan Sule, Zsolt Kosztyán
Optimization of Business Process Decision Sequences and Human Resource Allocation via Process SynthesisAndrás Aschenbrenner, Léna Kiss, Botond Bertok
15:00-15:15 Break
15:15-16:45 Parallel Session 9A: Optimization in Agriculture and Food Industry
Chair: Botond Bertok
Integrated Optimization of Land Use and Supply Chain Structures for Regional Agricultural ProductsJean Pimentel, Erika Lakatos, Rita Székelyhidi, Károly Kalauz, Botond Bertok
Production Scheduling Optimization in Cheese Manufacturing Using P-graph MethodologyKároly Kalauz, Erika Lakatos, Anikó Vadász, Botond Bertok
Optimal Energy and Water Utilization Scheduling for Agrivoltaic OperationsBotond Bertok, Balázs Ásványi, Károly Kalauz
16:45-17:00 Closing
|
