Large-scale optimization problems
Handling optimization problems emerging from the strcutural or dynamical analisys and control of complex dynamical systems. Restructuring and reformulating (mixed-integer) linear programming problems. Turning MILPs into LPs by exploiting special properties of the problem.
Chemical Reaction Networks Theory
Finding dynamically equivalent reaction networks with prescribed properties by solving specially formulated optimization problems. Finding reaction network structures with desired conservation properties.
Control of large scale transportation networks
Rescheduling trains in a dense network to minimize the total accumulated delay. Using proper problem restructuring, solving the corresponding large-scale MILP in a given time limit.
(from the Publication List)
 "Polynomial time algorithms to determine weakly reversible realizations of chemical reaction networks," J. Rudan, G. Szederkenyi, K. M. Hangos, and T. Peni, Journal of Mathematical Chemistry, pp. 1-19, 2014.
 "Railway traffic management using switching max-plus-linear systems," B. Kersbergen, J. Rudan, T. van den Boom, and B. D. Schutter, Discrete Event Dynamic Systems, accepted on Nov. 27. 2014.
 "Efficiently computing alternative structures of large biochemical reaction networks using linear programming," J. Rudan, G. Szederkenyi, and K. M. Hangos, MATCH Commun. Math. Comput. Chem., vol. 71, pp. 71-92, 2014.
 "Performance analysis of MILP based model predictive control algorithms for dynamic railway scheduling," J. Rudan, B. Kersbergen, T. van den Boom, and K. M. Hangos, European Control Conference (ECC2013), July 17-19 2013, Zurich, pp. 4562-4567, 2013.