output
20112026
most citedA review of possible effects of cognitive biases on the interpretation of rule-based machine learning models

138 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing math.OCShow all

6 papers · 1 filter

math.OC2019

Walks on hyperplane arrangements and optimization of piecewise linear functions

Michal Černý, Milan Hladík, Miroslav Rada

We propose an exact iterative algorithm for minimization of a class of continuous cell-wise linear convex functions on a hyperplane arrangement. Our particular setup is motivated b…

math.OC2019★ 1 cited

A new polynomially solvable class of quadratic optimization problems with box constraints

Milan Hladík, Michal Černý, Miroslav Rada

We consider the quadratic optimization problem , where is a box and is assumed to be $\mathcal{O}(…

math.OC2018★ 2 cited

Interval Linear Programming under Transformations: Optimal Solutions and Optimal Value Range

Elif Garajová, Milan Hladík, Miroslav Rada

Interval linear programming provides a tool for solving real-world optimization problems under interval-valued uncertainty. Instead of approximating or estimating crisp input data,…

math.OC2017★ 10 cited

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…

math.OC2017★ 15 cited

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.…

math.OC2014★ 27 cited

Robust optimal solutions in interval linear programming with forall-exists quantifiers

Milan Hladík

We introduce a novel kind of robustness in linear programming. A solution x* is called robust optimal if for all realizations of objective functions coefficients and constraint mat…