Miroslav Rada

Orcid: 0000-0002-1761-897X

According to our database1, Miroslav Rada authored at least 15 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
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., December, 2024

2023
Interval transportation problem: feasibility, optimality and the worst optimal value.
Central Eur. J. Oper. Res., September, 2023

New pruning tests for the branch-and-prune framework for interval parametric linear systems.
Soft Comput., 2023

Dispersion of Personal Spaces.
Proceedings of the Dynamics of Information Systems - 6th International Conference, 2023

A Quasi-extreme Reduction for Interval Transportation Problems.
Proceedings of the Dynamics of Information Systems - 6th International Conference, 2023

2021
A new polynomially solvable class of quadratic optimization problems with box constraints.
Optim. Lett., 2021

The Horizontal Linear Complementarity Problem and Robustness of the Related Matrix Classes.
Proceedings of the Optimization and Learning - 4th International Conference, 2021

2020
Outcome Range Problem in Interval Linear Programming: An Exact Approach.
Proceedings of the Integrated Uncertainty in Knowledge Modelling and Decision Making, 2020

Rank Estimators for Robust Regression: Approximate Algorithms, Exact Algorithms and Two-Stage Methods.
Proceedings of the Integrated Uncertainty in Knowledge Modelling and Decision Making, 2020

2019
Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases.
Optim. Lett., 2019

The algorithm by Ferson et al. is surprisingly fast: An NP-hard optimization problem solvable in almost linear time with high probability.
CoRR, 2019

Interval linear programming under transformations: optimal solutions and optimal value range.
Central Eur. J. Oper. Res., 2019

2018
A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search.
SIAM J. Discret. Math., 2018

A Note on Partial Identification of Regression Parameters in Regression with Interval-Valued Dependent Variable.
Proceedings of the Applied Computer Sciences in Engineering, 2018

2012
Polynomial Time Construction of Ellipsoidal Approximations of Zonotopes Given by Generator Descriptions.
Proceedings of the Theory and Applications of Models of Computation, 2012


  Loading...