Login / Signup
Elif Garajová
ORCID
Publication Activity (10 Years)
Years Active: 2019-2023
Publications (10 Years): 8
Top Topics
Np Hard
Polynomially Solvable
Transportation Problem
Linear Program
Top Venues
Soft Comput.
Central Eur. J. Oper. Res.
DIS
Comput. Optim. Appl.
</>
Publications
</>
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) (2023)
Elif Garajová
,
Miroslav Rada
Interval transportation problem: feasibility, optimality and the worst optimal value.
Central Eur. J. Oper. Res.
31 (3) (2023)
Elif Garajová
,
Miroslav Rada
A Quasi-extreme Reduction for Interval Transportation Problems.
DIS
(2023)
Elif Garajová
,
Miroslav Rada
,
Milan Hladík
Outcome Range Problem in Interval Linear Programming: An Exact Approach.
IUKM
(2020)
Elif Garajová
,
Milan Hladík
Checking weak optimality and strong boundedness in interval linear programming.
Soft Comput.
23 (9) (2019)
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) (2019)
Elif Garajová
,
Milan Hladík
On the optimal solution set in interval linear programming.
Comput. Optim. Appl.
72 (1) (2019)
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) (2019)