Markó Horváth

发表

Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price

T. Kis, Markó Horváth, 2017, Central European Journal of Operations Research.

Multi-criteria approximation schemes for the resource constrained shortest path problem

T. Kis, Markó Horváth, 2017, Optimization Letters.

Solving resource constrained shortest path problems with Branch-and-Cut

T. Kis, Markó Horváth, 2014 .

Ideal, non-extended formulations for disjunctive constraints admitting a network representation

T. Kis, Markó Horváth, 2021, Mathematical Programming.

Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price

Tamás Kis, Markó Horváth, T. Kis, 2017, Central European Journal of Operations Research.

Solving resource constrained shortest path problems with LP-based methods

Tamás Kis, Markó Horváth, T. Kis, 2016, Comput. Oper. Res..

Polyhedral results and valid inequalities for the continuous energy-constrained scheduling problem

Pierre Lopez, Christian Artigues, Tamás Kis, 2017, Discret. Appl. Math..

Multi-criteria approximation schemes for the resource constrained shortest path problem

Tamás Kis, Markó Horváth, T. Kis, 2018, Optim. Lett..

Suboptimal and conflict-free control of a fleet of AGVs to serve online requests

Péter Györgyi, Tamás Kis, Markó Horváth, 2020, Comput. Ind. Eng..

Assembly planning by disjunctive programming and geometrical reasoning

Tamás Kis, András Kovács, Markó Horváth, 2021, Comput. Oper. Res..

Ideal, non-extended formulations for disjunctive constraints admitting a network representation

Tamás Kis, Markó Horváth, T. Kis, 2021, Mathematical Programming.

Computers and Operations Research

T. Kis, Markó Horváth, Márk Fekula, 2022 .