Solving resource constrained shortest path problems with LP-based methods. - Markó Horváth; Tamás Kis (Comput. Oper. Res., 2016)

Multi-criteria approximation schemes for the resource constrained shortest path problem. - Markó Horváth; Tamás Kis (Optim. Lett., 2018)

Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price. - Markó Horváth; Tamás Kis (Central Eur. J. Oper. Res., 2019)

Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem. - Margaux Nattaf; Markó Horváth; Tamás Kis; Christian Artigues; Pierre Lopez (Discret. Appl. Math., 2019)

Polyhedral results for position-based scheduling of chains on a single machine. - Markó Horváth; Tamás Kis (Ann. Oper. Res., 2020)

Suboptimal and conflict-free control of a fleet of AGVs to serve online requests. - Márton Drótos; Péter Györgyi; Markó Horváth; Tamás Kis (Comput. Ind. Eng., 2021)

Assembly planning by disjunctive programming and geometrical reasoning. - Markó Horváth; Tamás Kis; András Kovács; Márk Fekula (Comput. Oper. Res., 2022)

Ideal, non-extended formulations for disjunctive constraints admitting a network representation. - Tamás Kis; Markó Horváth (Math. Program., 2022)

New computational results for integrated production and outbound distribution scheduling problems for a product with a short lifespan. - Markó Horváth (EURO J. Comput. Optim., 2024)

On recent computational results for a dynamic pickup and delivery problem. - Markó Horváth; Tamás Kis (Memetic Comput., 2025)