Polynomial Time Construction of Ellipsoidal Approximations of Zonotopes Given by Generator Descriptions. - Michal Cerný; Miroslav Rada (TAMC, 2012)

A Note on Partial Identification of Regression Parameters in Regression with Interval-Valued Dependent Variable. - Michal Cerný; Tomás Cipra; Radek Hendrych; Ondrej Sokol; Miroslav Rada (WEA (1), 2018)

A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search. - Miroslav Rada; Michal Cerný (SIAM J. Discret. Math., 2018)

Interval linear programming under transformations: optimal solutions and optimal value range. - Elif Garajová; Milan Hladík; Miroslav Rada (Central Eur. J. Oper. Res., 2019)

The algorithm by Ferson et al. is surprisingly fast: An NP-hard optimization problem solvable in almost linear time with high probability. - Michal Cerný; Ondrej Sokol; Miroslav Rada (CoRR, 2019)

Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases. - Miroslav Rada; Milan Hladík; Elif Garajová (Optim. Lett., 2019)

Rank Estimators for Robust Regression: Approximate Algorithms, Exact Algorithms and Two-Stage Methods. - Michal Cerný; Miroslav Rada; Ondrej Sokol (IUKM, 2020)

Outcome Range Problem in Interval Linear Programming: An Exact Approach. - Elif Garajová; Miroslav Rada; Milan Hladík (IUKM, 2020)

The Horizontal Linear Complementarity Problem and Robustness of the Related Matrix Classes. - Milan Hladík; Miroslav Rada (OLA, 2021)

A new polynomially solvable class of quadratic optimization problems with box constraints. - Milan Hladík; Michal Cerný; Miroslav Rada (Optim. Lett., 2021)

A Quasi-extreme Reduction for Interval Transportation Problems. - Elif Garajová; Miroslav Rada (DIS, 2023)

Dispersion of Personal Spaces. - Jaroslav Horácek; Miroslav Rada (DIS, 2023)

New pruning tests for the branch-and-prune framework for interval parametric linear systems. - Miroslav Rada; Elif Garajová; Jaroslav Horácek; Milan Hladík (Soft Comput., 2023)

Interval transportation problem: feasibility, optimality and the worst optimal value. - Elif Garajová; Miroslav Rada (Central Eur. J. Oper. Res., 2023)

The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability. - Miroslav Rada; Michal Cerný; Ondrej Sokol (Comput. Complex., 2024)

0-1 Linear programming under interval uncertainty. - Elif Garajová; Milan Hladík; Miroslav Rada (Soft Comput., 2025)

Complexity of computing the worst optimal value of interval transportation problems. - Elif Garajová; Miroslav Rada (Central Eur. J. Oper. Res., 2025)