default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMiroslav Rada
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Miroslav Rada, Michal Cerný, Ondrej Sokol:
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. 33(2): 8 (2024)- [i2]Jaroslav Horácek, Miroslav Rada:
Dispersion of personal spaces. CoRR abs/2405.19895 (2024) - 2023
- [j6]Elif Garajová
, Miroslav Rada:
Interval transportation problem: feasibility, optimality and the worst optimal value. Central Eur. J. Oper. Res. 31(3): 769-790 (2023) - [j5]Miroslav Rada, Elif Garajová, Jaroslav Horácek, Milan Hladík:
New pruning tests for the branch-and-prune framework for interval parametric linear systems. Soft Comput. 27(18): 12897-12912 (2023) - [c7]Elif Garajová, Miroslav Rada:
A Quasi-extreme Reduction for Interval Transportation Problems. DIS 2023: 83-92 - [c6]Jaroslav Horácek, Miroslav Rada:
Dispersion of Personal Spaces. DIS 2023: 159-169 - 2021
- [j4]Milan Hladík, Michal Cerný, Miroslav Rada:
A new polynomially solvable class of quadratic optimization problems with box constraints. Optim. Lett. 15(6): 2331-2341 (2021) - [c5]Milan Hladík, Miroslav Rada:
The Horizontal Linear Complementarity Problem and Robustness of the Related Matrix Classes. OLA 2021: 350-360 - 2020
- [c4]Elif Garajová, Miroslav Rada, Milan Hladík:
Outcome Range Problem in Interval Linear Programming: An Exact Approach. IUKM 2020: 3-14 - [c3]Michal Cerný, Miroslav Rada, Ondrej Sokol:
Rank Estimators for Robust Regression: Approximate Algorithms, Exact Algorithms and Two-Stage Methods. IUKM 2020: 162-173
2010 – 2019
- 2019
- [j3]Elif Garajová, Milan Hladík, Miroslav Rada:
Interval linear programming under transformations: optimal solutions and optimal value range. Central Eur. J. Oper. Res. 27(3): 601-614 (2019) - [j2]Miroslav Rada, Milan Hladík, Elif Garajová:
Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases. Optim. Lett. 13(4): 875-890 (2019) - [i1]Michal Cerný, Ondrej Sokol, Miroslav Rada:
The algorithm by Ferson et al. is surprisingly fast: An NP-hard optimization problem solvable in almost linear time with high probability. CoRR abs/1905.07821 (2019) - 2018
- [j1]Miroslav Rada, Michal Cerný:
A New Algorithm for Enumeration of Cells of Hyperplane Arrangements and a Comparison with Avis and Fukuda's Reverse Search. SIAM J. Discret. Math. 32(1): 455-473 (2018) - [c2]Michal Cerný, Tomás Cipra, Radek Hendrych, Ondrej Sokol, Miroslav Rada:
A Note on Partial Identification of Regression Parameters in Regression with Interval-Valued Dependent Variable. WEA (1) 2018: 55-65 - 2012
- [c1]Michal Cerný, Miroslav Rada:
Polynomial Time Construction of Ellipsoidal Approximations of Zonotopes Given by Generator Descriptions. TAMC 2012: 156-163
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-16 19:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
