An integer programming approach to routing in daisy networks. - Johanna Becker; Zsolt Csizmadia; Jérôme Galtier; Alexandre Laugier; Jácint Szabó; László Szegö (Networks, 2006)

New criss-cross type algorithms for linear complementarity problems with sufficient matrices. - Zsolt Csizmadia; Tibor Illés (Optim. Methods Softw., 2006)

Anstreicher-Terlaky type monotonic simplex algorithms for linear feasibility problems. - Filiz Bilen; Zsolt Csizmadia; Tibor Illés (Optim. Methods Softw., 2007)

Balancing congestion for unsplittable routing on a bidirected ring - Johanna Becker; Zsolt Csizmadia; Alexandre Laugier; Jácint Szabó; László Szegö (CoRR, 2010)

A stochastic programming and simulation based analysis of the structure of production on the arable land. - Béla Vizvári; Zoltán Lakner; Zsolt Csizmadia; Gergely Kovács (Ann. Oper. Res., 2011)

The s-monotone index selection rules for pivot algorithms of linear programming. - Zsolt Csizmadia; Tibor Illés; Adrienn Nagy (Eur. J. Oper. Res., 2012)

Finiteness of the quadratic primal simplex method when s-monotone index selection rules are applied. - Adrienn Csizmadia; Zsolt Csizmadia; Tibor Illés (Central Eur. J. Oper. Res., 2018)

The confined primal integral: a measure to benchmark heuristic MINLP solvers against global MINLP solvers. - Timo Berthold; Zsolt Csizmadia (Math. Program., 2021)