Interval linear programming under transformations: optimal solutions and optimal value range E Garajová, M Hladík, M Rada Central European Journal of Operations Research 27 (3), 601-614, 2019 | 34 | 2019 |
A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search M Rada, M Černý SIAM Journal on Discrete Mathematics 32 (1), 455-473, 2018 | 25 | 2018 |
On the possibilistic approach to linear regression with rounded or interval-censored data M Černý, M Rada Measurement Science Review 11 (2), 34-40, 2011 | 19 | 2011 |
On the Properties of Interval Linear Programs with a Fixed Coefficient Matrix E Garajová, M Hladík, M Rada International Conference on Optimization and Decision Science, 393-401, 2017 | 14 | 2017 |
A class of optimization problems motivated by rank estimators in robust regression M Černý, M Rada, J Antoch, M Hladík Optimization, 1-31, 2020 | 9 | 2020 |
Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases M Rada, M Hladík, E Garajová Optimization Letters 13 (4), 875-890, 2019 | 7 | 2019 |
Interval transportation problem: feasibility, optimality and the worst optimal value E Garajová, M Rada Central European Journal of Operations Research, 1-22, 2023 | 6 | 2023 |
A new polynomially solvable class of quadratic optimization problems with box constraints M Hladík, M Černý, M Rada Optimization Letters, 1-11, 2021 | 5 | 2021 |
The best, the worst and the semi-strong: optimal values in interval linear programming E Garajová, M Hladík, M Rada Croatian Operational Research Review, 201-209, 2019 | 4 | 2019 |
The effects of transformations on the optimal set in interval linear programming E Garajová, M Hladk, M Rada Proceedings of the 14th International Symposium on Operational Research …, 2017 | 4 | 2017 |
Integer Programming Reformulations in Interval Linear Programming E Garajová, M Rada, M Hladík Optimization and Decision Science: ODS, Virtual Conference, November 19 …, 2021 | 3 | 2021 |
A Quasi-extreme Reduction for Interval Transportation Problems E Garajová, M Rada International Conference on the Dynamics of Information Systems, 83-92, 2023 | 2 | 2023 |
New pruning tests for the branch-and-prune framework for interval parametric linear systems M Rada, E Garajová, J Horáček, M Hladík Soft Computing, 1-16, 2022 | 2 | 2022 |
Rank Estimators for Robust Regression: Approximate Algorithms, Exact Algorithms and Two-Stage Methods M Černý, M Rada, O Sokol International Symposium on Integrated Uncertainty in Knowledge Modelling and …, 2020 | 2 | 2020 |
Outcome Range Problem in Interval Linear Programming: An Exact Approach E Garajová, M Rada, M Hladík International Symposium on Integrated Uncertainty in Knowledge Modelling and …, 2020 | 2 | 2020 |
Walks on hyperplane arrangements and optimization of piecewise linear functions M Černý, M Hladík, M Rada arXiv preprint arXiv:1912.12750, 2019 | 2 | 2019 |
The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with high probability M Rada, M Černý, O Sokol arXiv preprint arXiv:1905.07821, 2019 | 1* | 2019 |
Range sets for weak efficiency in multiobjective linear programming and a parametric polytopes intersection problem M Hladík, M Rada, S Sitarz, E Garajová Optimization 68 (2-3), 645-666, 2019 | 1 | 2019 |
Polynomial time construction of ellipsoidal approximations of zonotopes given by generator descriptions M Černý, M Rada International Conference on Theory and Applications of Models of Computation …, 2012 | 1 | 2012 |
Dispersion of personal spaces J Horáček, M Rada International Conference on the Dynamics of Information Systems, 159-169, 2023 | | 2023 |