Gábor Rudolf

Publication Activity (10 Years)

Years Active: 2006-2022
Publications (10 Years): 4

Top Topics

Robust Optimization

Queueing Networks

Complexity Analysis

Top Venues

Ann. Oper. Res.

Publications

Nilay Noyan, Gábor Rudolf, Miguel A. Lejeune
Distributionally Robust Optimization Under a Decision-Dependent Ambiguity Set with Applications to Machine Scheduling and Humanitarian Logistics. INFORMS J. Comput. 34 (2) (2022)
Noam Goldberg, Gábor Rudolf
On the complexity and approximation of the maximum expected value all-or-nothing subset. Discret. Appl. Math. 283 (2020)
Nilay Noyan, Gábor Rudolf
Optimization with Stochastic Preferences Based on a General Class of Scalarization Functions. Oper. Res. 66 (2) (2018)
Noam Goldberg, Gábor Rudolf
On the Complexity and Approximation of the Maximum Expected Value All-or-Nothing Subset. CoRR (2017)
Nilay Noyan, Gábor Rudolf
Kusuoka representations of coherent risk measures in general probability spaces. Ann. Oper. Res. 229 (1) (2015)
Andrey Gol'berg, Vladimir Gurvich, Diogo Vieira Andrade, Konrad Borys, Gábor Rudolf
Combinatorial games modeling seki in GO. Discret. Math. 329 (2014)
Gábor Rudolf, Nilay Noyan, Vincent Giard
Modeling sequence scrambling and related phenomena in mixed-model production lines. Eur. J. Oper. Res. 237 (1) (2014)
Nilay Noyan, Gábor Rudolf
Optimization with Multivariate Conditional Value-at-Risk Constraints. Oper. Res. 61 (4) (2013)
Edwin J. C. G. van den Oord, József Bukszár, Gábor Rudolf, Srilaxmi Nerella, Joseph L. McClay, Lin Y. Xie, Karolina A. Åberg
Estimation of CpG coverage in whole methylome next-generation sequencing studies. BMC Bioinform. 14 (2013)
Gábor Rudolf, Nilay Noyan, Dávid Papp, Farid Alizadeh
Bilinear optimality constraints for the cone of positive polynomials. Math. Program. 129 (1) (2011)
Martin Milanic, James B. Orlin, Gábor Rudolf
Complexity results for equistable graphs and related classes. Ann. Oper. Res. 188 (1) (2011)
Farid Alizadeh, Jonathan Eckstein, Nilay Noyan, Gábor Rudolf
Arrival Rate Approximation by Nonnegative Cubic Splines. Oper. Res. 56 (1) (2008)
Endre Boros, Konrad Borys, Vladimir Gurvich, Gábor Rudolf
Generating 3-vertex connected spanning subgraphs. Discret. Math. 308 (24) (2008)
Leonid Khachiyan, Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Gábor Rudolf, Jihui Zhao
On Short Paths Interdiction Problems: Total and Node-Wise Limited Interdiction. Theory Comput. Syst. 43 (2) (2008)
Gábor Rudolf, Andrzej Ruszczynski
Optimization Problems with Second Order Stochastic Dominance Constraints: Duality, Compact Formulations, and Cut Generation Methods. SIAM J. Optim. 19 (3) (2008)
Vadim V. Lozin, Gábor Rudolf
Minimal Universal Bipartite Graphs. Ars Comb. 84 (2007)
Endre Boros, Konrad Borys, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino, Gábor Rudolf
Generating Minimal k-Vertex Connected Spanning Subgraphs. COCOON (2007)
Nilay Noyan, Gábor Rudolf, Andrzej Ruszczynski
Relaxations of linear programming problems with first order stochastic dominance constraints. Oper. Res. Lett. 34 (6) (2006)