138 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Charles UniversityCZ11 papers
- Czech Academy of Sciences, Institute of Information Theory and AutomationCZ5 papers
- Czech Technical University in PragueCZ5 papers
- University of MannheimDE3 papers
- Johannes Kepler University of LinzAT2 papers
- Queen Mary University of LondonGB2 papers
- University of California, BerkeleyUS2 papers
- University of OxfordGB2 papers
- University of TurinIT2 papers
- Utrecht UniversityNL2 papers
- American UniversityUS1 paper
- Cambridge Econometrics (United Kingdom)GB1 paper
5 papers · 1 filter
Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomial cases
Miroslav Rada, Milan Hladík, Elif Garajová
We address the problem of testing weak optimality of a given solution of a given interval linear program. The problem was recently wrongly stated to be polynomially solvable. We di…
QCBA: Improving Rule Classifiers Learned from Quantitative Data by Recovering Information Lost by Discretisation
Tomas Kliegr, Ebroul Izquierdo
A prediscretisation of numerical attributes which is required by some rule learning algorithms is a source of inefficiencies. This paper describes new rule tuning steps that aim to…
Transitions between superstatistical regimes: validity, breakdown and applications
Petr Jizba, Jan Korbel, Hynek Lavička +3
Superstatistics is a widely employed tool of non-equilibrium statistical physics which plays an important role in analysis of hierarchical complex dynamical systems. Yet, its "cano…
Disaggregating Input--Output Tables by the Multidimensional RAS Method: A Case Study of the Czech Republic
Vladimír Holý, Karel Šafr
The RAS method is an iterative procedure that bi-proportionally scales an input-output table to be consistent with given row and column sums. It can be used to disaggregate an annu…
A novel data envelopment analysis ranking based on a robust approach
Milan Hladík
We propose a novel DEA ranking based on a robust optimization viewpoint: the higher ranking for those DMU's that remain efficient even for larger variations of data and vice versa.…