Soft robust solutions to possibilistic optimization problems | 0 | 0.34 | 2021 |
Combinatorial Two-Stage Minmax Regret Problems Under Interval Uncertainty | 0 | 0.34 | 2021 |
Two-stage combinatorial optimization problems under risk | 1 | 0.35 | 2020 |
Robust Possibilistic Production Planning Under Budgeted Demand Uncertainty | 0 | 0.34 | 2020 |
Risk-averse single machine scheduling: complexity and approximation | 1 | 0.35 | 2019 |
Robust two-stage combinatorial optimization problems under convex uncertainty. | 0 | 0.34 | 2019 |
Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty. | 0 | 0.34 | 2019 |
A (Soft) Robustness for Possibilistic Optimization Problems | 1 | 0.36 | 2019 |
Production Planning Under Demand Uncertainty - A Budgeted Uncertainty Approach. | 0 | 0.34 | 2019 |
On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty. | 4 | 0.41 | 2018 |
Approximating multiobjective combinatorial optimization problems with the OWA criterion. | 0 | 0.34 | 2018 |
Robust recoverable 0–1 optimization problems under polyhedral uncertainty | 0 | 0.34 | 2018 |
Approximating some network problems with scenarios. | 0 | 0.34 | 2018 |
Recoverable robust spanning tree problem under interval uncertainty representations. | 4 | 0.44 | 2017 |
Risk averse single machine scheduling - complexity and approximation. | 0 | 0.34 | 2017 |
Risk Averse Scheduling with Scenarios. | 0 | 0.34 | 2017 |
The recoverable robust spanning tree problem with interval costs is polynomially solvable | 2 | 0.39 | 2017 |
A Robust Approach To A Class Of Uncertain Optimization Problems With Imprecise Probabilities | 0 | 0.34 | 2016 |
Robust Two-Stage Network Problems | 0 | 0.34 | 2015 |
Robust recoverable and two-stage selection problems | 5 | 0.48 | 2015 |
Single machine scheduling problems with uncertain parameters and the OWA criterion. | 5 | 0.47 | 2014 |
Complexity of the robust weighted independent set problems on interval graphs. | 0 | 0.34 | 2014 |
Approximability of the robust representatives selection problem | 1 | 0.35 | 2014 |
Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion. | 1 | 0.36 | 2014 |
Robust Discrete Optimization Problems with the WOWA Criterion. | 0 | 0.34 | 2014 |
Sequencing Problems with Uncertain Parameters and the OWA Criterion. | 0 | 0.34 | 2013 |
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion | 3 | 0.40 | 2013 |
Combinatorial optimization problems with uncertain costs and the OWA criterion. | 1 | 0.35 | 2013 |
Approximating the min-max (regret) selecting items problem | 14 | 0.92 | 2013 |
Parallel Machine Scheduling under Uncertainty. | 4 | 0.42 | 2012 |
Approximating Combinatorial Optimization Problems with Uncertain Costs and the OWA Criterion. | 0 | 0.34 | 2012 |
Recoverable Robust Combinatorial Optimization Problems. | 2 | 0.39 | 2012 |
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. | 17 | 0.68 | 2012 |
A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data | 9 | 0.58 | 2012 |
On the approximability of robust spanning tree problems | 13 | 0.61 | 2011 |
Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios. | 1 | 0.36 | 2011 |
Min-max and two-stage possibilistic combinatorial optimization problems | 0 | 0.34 | 2011 |
Possibilistic Minmax Regret Sequencing Problems With Fuzzy Parameters | 2 | 0.37 | 2011 |
Possibilistic bottleneck combinatorial optimization problems with ill-known weights | 0 | 0.34 | 2011 |
Computing mean absolute deviation under uncertainty | 3 | 0.39 | 2010 |
Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights | 12 | 0.59 | 2010 |
A randomized algorithm for the min-max selecting items problem with uncertain weights | 7 | 0.57 | 2009 |
On Possibilistic Sequencing Problems With Fuzzy Parameters | 0 | 0.34 | 2009 |
Choosing robust solutions in discrete optimization problems with fuzzy costs | 18 | 0.71 | 2009 |
On the approximability of minmax (regret) network optimization problems | 20 | 1.01 | 2009 |
A Possibilistic Approach To Bottleneck Combinatorial Optimization Problems With Ill-Known Weights | 0 | 0.34 | 2009 |
Some methods for evaluating the optimality of elements in matroids with ill-known weights | 2 | 0.42 | 2009 |
The minimum spanning tree problem with fuzzy costs | 5 | 0.67 | 2008 |
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion | 21 | 0.91 | 2008 |
On combinatorial optimization problems on matroids with uncertain weights | 15 | 0.98 | 2007 |