Miroslav Rada

18 papers A 2C 1Journal 11Unranked 4
YearRankTypeTitle / Venue / Authors
2025 J jnl
0-1 Linear programming under interval uncertainty.
Soft Comput.
Elif Garajová, Milan Hladík, Miroslav Rada
2025 J jnl
Complexity of computing the worst optimal value of interval transportation problems.
Central Eur. J. Oper. Res.
Elif Garajová, Miroslav Rada
2024 J jnl
Dispersion of personal spaces.
CoRR
Jaroslav Horácek, Miroslav Rada
2024 J jnl
The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability.
Comput. Complex.
Miroslav Rada, Michal Cerný, Ondrej Sokol
2023 A conf
A Quasi-extreme Reduction for Interval Transportation Problems.
DIS
Elif Garajová, Miroslav Rada
2023 A conf
Dispersion of Personal Spaces.
DIS
Jaroslav Horácek, Miroslav Rada
2023 J jnl
Interval transportation problem: feasibility, optimality and the worst optimal value.
Central Eur. J. Oper. Res.
Elif Garajová, Miroslav Rada
2023 J jnl
New pruning tests for the branch-and-prune framework for interval parametric linear systems.
Soft Comput.
Miroslav Rada, Elif Garajová, Jaroslav Horácek, Milan Hladík
2021 J jnl
A new polynomially solvable class of quadratic optimization problems with box constraints.
Optim. Lett.
Milan Hladík, Michal Cerný, Miroslav Rada
2021 — conf
The Horizontal Linear Complementarity Problem and Robustness of the Related Matrix Classes.
OLA
Milan Hladík, Miroslav Rada
2020 — conf
Outcome Range Problem in Interval Linear Programming: An Exact Approach.
IUKM
Elif Garajová, Miroslav Rada, Milan Hladík
2020 — conf
Rank Estimators for Robust Regression: Approximate Algorithms, Exact Algorithms and Two-Stage Methods.
IUKM
Michal Cerný, Miroslav Rada, Ondrej Sokol
2019 J jnl
Interval linear programming under transformations: optimal solutions and optimal value range.
Central Eur. J. Oper. Res.
Elif Garajová, Milan Hladík, Miroslav Rada
2019 J jnl
Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases.
Optim. Lett.
Miroslav Rada, Milan Hladík, Elif Garajová
2019 J jnl
The algorithm by Ferson et al. is surprisingly fast: An NP-hard optimization problem solvable in almost linear time with high probability.
CoRR
Michal Cerný, Ondrej Sokol, Miroslav Rada
2018 J jnl
A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search.
SIAM J. Discret. Math.
Miroslav Rada, Michal Cerný
2018 — conf
A Note on Partial Identification of Regression Parameters in Regression with Interval-Valued Dependent Variable.
WEA (1)
Michal Cerný, Tomás Cipra, Radek Hendrych, Ondrej Sokol, Miroslav Rada
2012 C conf
Polynomial Time Construction of Ellipsoidal Approximations of Zonotopes Given by Generator Descriptions.
TAMC
Michal Cerný, Miroslav Rada