Pawel Zielinski

Proceedings of the 30th IEEE International Conference on Fuzzy Systems, 2021

Robust optimization with scenarios using random fuzzy sets.

[BibT_eX]

[DOI]

Proceedings of the 30th IEEE International Conference on Fuzzy Systems, 2021

Distributionally Robust Optimization in Possibilistic Setting.

[BibT_eX]

[DOI]

Proceedings of the 30th IEEE International Conference on Fuzzy Systems, 2021

2020

Two-stage combinatorial optimization problems under risk.

[BibT_eX]

[DOI]

Marc Goerigk

Theor. Comput. Sci., 2020

Approximating combinatorial optimization problems with the ordered weighted averaging criterion.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2020

Robust production planning with budgeted cumulative demand uncertainty.

[BibT_eX]

[DOI]

CoRR, 2020

Softening the Robustness of Optimization Problems: A New Budgeted Uncertainty Approach.

[BibT_eX]

[DOI]

Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2020

Robust Possibilistic Production Planning Under Budgeted Demand Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the 29th IEEE International Conference on Fuzzy Systems, 2020

2019

Risk-averse single machine scheduling: complexity and approximation.

[BibT_eX]

[DOI]

J. Sched., 2019

Robust recoverable 0-1 optimization problems under polyhedral uncertainty.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2019

Robust two-stage combinatorial optimization problems under convex uncertainty.

[BibT_eX]

[DOI]

Marc Goerigk

CoRR, 2019

Production Planning Under Demand Uncertainty: A Budgeted Uncertainty Approach.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2019, 2019

Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty.

[BibT_eX]

[DOI]

Marc Goerigk

Proceedings of the Operations Research Proceedings 2019, 2019

A (Soft) Robustness for Possibilistic Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the 2019 IEEE International Conference on Fuzzy Systems, 2019

2018

On recoverable and two-stage robust selection problems with budgeted uncertainty.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

Approximating some network problems with scenarios.

[BibT_eX]

[DOI]

CoRR, 2018

Approximating multiobjective combinatorial optimization problems with the OWA criterion.

[BibT_eX]

[DOI]

CoRR, 2018

2017

The recoverable robust spanning tree problem with interval costs is polynomially solvable.

[BibT_eX]

[DOI]

Optim. Lett., 2017

Recoverable robust spanning tree problem under interval uncertainty representations.

[BibT_eX]

[DOI]

J. Comb. Optim., 2017

Robust material requirement planning with cumulative demand under uncertainty.

[BibT_eX]

[DOI]

Caroline Thierry

Int. J. Prod. Res., 2017

Robust recoverable and two-stage selection problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Risk Averse Scheduling with Scenarios.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2017, 2017

2016

Single machine scheduling problems with uncertain parameters and the OWA criterion.

[BibT_eX]

[DOI]

J. Sched., 2016

Using the WOWA operator in robust discrete optimization problems.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2016

The robust recoverable spanning tree problem with interval costs is polynomially solvable.

[BibT_eX]

[DOI]

CoRR, 2016

A robust approach to a class of uncertain optimization problems with imprecise probabilities.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE International Conference on Fuzzy Systems, 2016

2015

Combinatorial optimization problems with uncertain costs and the OWA criterion.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Approximability of the robust representatives selection problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2015

Complexity of the robust weighted independent set problems on interval graphs.

[BibT_eX]

[DOI]

Optim. Lett., 2015

On iterative algorithms for the polar decomposition of a matrix and the matrix sign function.

[BibT_eX]

[DOI]

Andrzej Kielbasinski

Krystyna Zietak

Appl. Math. Comput., 2015

Robust Two-Stage Network Problems.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2015, 2015

2014

Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2014, 2014

Robust Discrete Optimization Problems with the WOWA Criterion.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2014, 2014

2013

Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2013

Approximating the min-max (regret) selecting items problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Sequencing Problems with Uncertain Parameters and the OWA Criterion.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2013, 2013

Robust production plan with periodic order quantity under uncertain cumulative demands.

[BibT_eX]

[DOI]

Caroline Thierry

Proceedings of 10th IEEE International Conference on Networking, Sensing and Control, 2013

2012

A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data.

[BibT_eX]

[DOI]

Mariusz Makuchowski

J. Heuristics, 2012

A robust lot sizing problem with ill-known demands.

[BibT_eX]

[DOI]

Przemyslaw Kobylanski

Fuzzy Sets Syst., 2012

Approximating a two-machine flow shop scheduling under discrete scenario uncertainty.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2012

Approximating Combinatorial Optimization Problems with Uncertain Costs and the OWA Criterion.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2012, 2012

Recoverable Robust Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Operations Research Proceedings 2012, 2012

Parallel Machine Scheduling under Uncertainty.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computational Intelligence, 2012

Decision Making under Scenario Uncertainty in a Requirement Planning.

[BibT_eX]

[DOI]

Proceedings of the Advances in Computational Intelligence, 2012

2011

Possibilistic Minmax Regret Sequencing Problems With Fuzzy Parameters.

[BibT_eX]

[DOI]

IEEE Trans. Fuzzy Syst., 2011

On the approximability of robust spanning tree problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Possibilistic bottleneck combinatorial optimization problems with ill-known weights.

[BibT_eX]

[DOI]

Int. J. Approx. Reason., 2011

Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios.

[BibT_eX]

[DOI]

Proceedings of the Nonlinear Mathematics for Uncertainty and its Applications, 2011

Min-max and two-stage possibilistic combinatorial optimization problems.

[BibT_eX]

[DOI]

Proceedings of the FUZZ-IEEE 2011, 2011

Production planning with uncertain demands.

[BibT_eX]

[DOI]

Przemyslaw Kobylanski

Proceedings of the FUZZ-IEEE 2011, 2011

2010

Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Fuzzy Optimization - Recent Advances and Applications, 2010

Interval PERT and Its Fuzzy Extension.

[BibT_eX]

[DOI]

Didier Dubois

Jérôme Fortin

Proceedings of the Production Engineering and Management under Fuzziness, 2010

Criticality analysis of activity networks under interval uncertainty.

[BibT_eX]

[DOI]

J. Sched., 2010

Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2010

2009

On the approximability of minmax (regret) network optimization problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

Some methods for evaluating the optimality of elements in matroids with ill-known weights.

[BibT_eX]

[DOI]

Jérôme Fortin

Fuzzy Sets Syst., 2009

A randomized algorithm for the min-max selecting items problem with uncertain weights.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2009

On Possibilistic Sequencing Problems with Fuzzy Parameters.

[BibT_eX]

[DOI]

Proceedings of the Joint 2009 International Fuzzy Systems Association World Congress and 2009 European Society of Fuzzy Logic and Technology Conference, 2009

A Possibilistic Approach to Bottleneck Combinatorial Optimization Problems with Ill-Known Weights.

[BibT_eX]

[DOI]

Proceedings of the Joint 2009 International Fuzzy Systems Association World Congress and 2009 European Society of Fuzzy Logic and Technology Conference, 2009

2008

A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2008

On possibilistic combinatorial optimization problems.

[BibT_eX]

[DOI]

Proceedings of the FUZZ-IEEE 2008, 2008

Solving combinatorial optimization problems with fuzzy weights.

[BibT_eX]

[DOI]

Proceedings of the FUZZ-IEEE 2008, 2008

2007

On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2007

On combinatorial optimization problems on matroids with uncertain weights.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2007

Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems.

[BibT_eX]

[DOI]

Proceedings of the Foundations of Fuzzy Logic and Soft Computing, 2007

Determining Unfuzzy Nondominated Solutions in Combinatorial Optimization Problems with Fuzzy Costs.

[BibT_eX]

[DOI]

Proceedings of the FUZZ-IEEE 2007, 2007

Random Subsets of the Interval and P2P Protocols.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2007

2006

The robust shortest path problem in series-parallel multidigraphs with interval data.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

An approximation algorithm for interval data minmax regret combinatorial optimization problems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Efficient computation of project characteristics in a series-parallel activity network with interval durations.

[BibT_eX]

[DOI]

Proceedings of the Decision Theory and Multi-Agent Planning, 2006

2005

On computing the latest starting times and floats of activities in a network with imprecise durations.

[BibT_eX]

[DOI]

Fuzzy Sets Syst., 2005

A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids.

[BibT_eX]

[DOI]

Proceedings of the Fuzzy Logic and Applications, 6th International Workshop, 2005

Efficient Methods for Computing Optimality Degrees of Elements in Fuzzy Weighted Matroids.

[BibT_eX]

[DOI]

Jérôme Fortin