Æȷοì
Miroslav Rada
Miroslav Rada
vse.czÀÇ À̸ÞÀÏ È®ÀεÊ
Á¦¸ñ
Àοë
Àοë
¿¬µµ
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
302019
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
212018
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
182011
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
122017
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
72020
A new polynomially solvable class of quadratic optimization problems with box constraints
M Hladík, M Černý, M Rada
Optimization Letters, 1-11, 2021
42021
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
42019
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
42017
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
32019
Interval transportation problem: feasibility, optimality and the worst optimal value
E Garajová, M Rada
Central European Journal of Operations Research, 1-22, 2023
22023
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
12022
Integer Programming Reformulations in Interval Linear Programming
E Garajová, M Rada, M Hladík
Optimization and Decision Science: ODS, Virtual Conference, November 19 ¡¦, 2021
12021
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
12020
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
12020
Walks on hyperplane arrangements and optimization of piecewise linear functions
M Černý, M Hladík, M Rada
arXiv preprint arXiv:1912.12750, 2019
12019
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
12019
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
12019
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
12012
The Horizontal Linear Complementarity Problem and Robustness of the Related Matrix Classes
M Hladík, M Rada
Optimization and Learning: 4th International Conference, OLA 2021, Catania ¡¦, 2021
2021
The algorithm by Ferson et al. is surprisingly fast: An NP-hard optimization problem solvable in almost linear time with high probability
M Černý, M Rada, O Sokol
arXiv preprint arXiv:1905.07821, 2019
2019
ÇöÀç ½Ã½ºÅÛÀÌ ÀÛµ¿µÇÁö ¾Ê½À´Ï´Ù. ³ªÁß¿¡ ´Ù½Ã ½ÃµµÇØ ÁÖ¼¼¿ä.
ÇмúÀÚ·á 1–20