Pawel Zielinski

Orcid: 0000-0002-1466-2887

Affiliations:
  • Wroclaw University of Technology, Poland
  • Technical University of Opole, Poland (former)


According to our database1, Pawel Zielinski authored at least 98 papers between 1999 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A framework of distributionally robust possibilistic optimization.
Fuzzy Optim. Decis. Mak., June, 2024

Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse.
CoRR, 2024

Recoverable robust shortest path problem under interval uncertainty representations.
CoRR, 2024

Recoverable Possibilistic Linear Programming.
Proceedings of the IEEE International Conference on Fuzzy Systems, 2024

2023
Robust optimization with belief functions.
Int. J. Approx. Reason., August, 2023

Distributionally robust possibilistic optimization problems.
Fuzzy Sets Syst., February, 2023

Solving the recoverable robust shortest path problem in DAGs.
CoRR, 2023

2022
Solving Robust Production Planning Problem with Interval Budgeted Uncertainty in Cumulative Demands.
Vietnam. J. Comput. Sci., 2022

Robust inventory problem with budgeted cumulative demand uncertainty.
Optim. Lett., 2022

Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty.
J. Comb. Optim., 2022

A framework of distributionally robust possibilistic optimization.
Proceedings of the Rencontres francophones sur la Logique Floue et ses Applications, 2022

2021
Soft robust solutions to possibilistic optimization problems.
Fuzzy Sets Syst., 2021

Combinatorial two-stage minmax regret problems under interval uncertainty.
Ann. Oper. Res., 2021

Robust Optimization with Scenarios Using Belief Functions.
Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021

Robust Possibilistic Optimization with Copula Function.
Proceedings of the 30th IEEE International Conference on Fuzzy Systems, 2021

Robust optimization with scenarios using random fuzzy sets.
Proceedings of the 30th IEEE International Conference on Fuzzy Systems, 2021

Distributionally Robust Optimization in Possibilistic Setting.
Proceedings of the 30th IEEE International Conference on Fuzzy Systems, 2021

2020
Two-stage combinatorial optimization problems under risk.
Theor. Comput. Sci., 2020

Approximating combinatorial optimization problems with the ordered weighted averaging criterion.
Eur. J. Oper. Res., 2020

Robust production planning with budgeted cumulative demand uncertainty.
CoRR, 2020

Softening the Robustness of Optimization Problems: A New Budgeted Uncertainty Approach.
Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2020

Robust Possibilistic Production Planning Under Budgeted Demand Uncertainty.
Proceedings of the 29th IEEE International Conference on Fuzzy Systems, 2020

2019
Risk-averse single machine scheduling: complexity and approximation.
J. Sched., 2019

Robust recoverable 0-1 optimization problems under polyhedral uncertainty.
Eur. J. Oper. Res., 2019

Robust two-stage combinatorial optimization problems under convex uncertainty.
CoRR, 2019

Production Planning Under Demand Uncertainty: A Budgeted Uncertainty Approach.
Proceedings of the Operations Research Proceedings 2019, 2019

Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty.
Proceedings of the Operations Research Proceedings 2019, 2019

A (Soft) Robustness for Possibilistic Optimization Problems.
Proceedings of the 2019 IEEE International Conference on Fuzzy Systems, 2019

2018
On recoverable and two-stage robust selection problems with budgeted uncertainty.
Eur. J. Oper. Res., 2018

Approximating some network problems with scenarios.
CoRR, 2018

Approximating multiobjective combinatorial optimization problems with the OWA criterion.
CoRR, 2018

2017
The recoverable robust spanning tree problem with interval costs is polynomially solvable.
Optim. Lett., 2017

Recoverable robust spanning tree problem under interval uncertainty representations.
J. Comb. Optim., 2017

Robust material requirement planning with cumulative demand under uncertainty.
Int. J. Prod. Res., 2017

Robust recoverable and two-stage selection problems.
Discret. Appl. Math., 2017

Risk Averse Scheduling with Scenarios.
Proceedings of the Operations Research Proceedings 2017, 2017

2016
Single machine scheduling problems with uncertain parameters and the OWA criterion.
J. Sched., 2016

Using the WOWA operator in robust discrete optimization problems.
Int. J. Approx. Reason., 2016

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

A robust approach to a class of uncertain optimization problems with imprecise probabilities.
Proceedings of the 2016 IEEE International Conference on Fuzzy Systems, 2016

2015
Combinatorial optimization problems with uncertain costs and the OWA criterion.
Theor. Comput. Sci., 2015

Approximability of the robust representatives selection problem.
Oper. Res. Lett., 2015

Complexity of the robust weighted independent set problems on interval graphs.
Optim. Lett., 2015

On iterative algorithms for the polar decomposition of a matrix and the matrix sign function.
Appl. Math. Comput., 2015

Robust Two-Stage Network Problems.
Proceedings of the Operations Research Proceedings 2015, 2015

2014
Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion.
Proceedings of the Operations Research Proceedings 2014, 2014

Robust Discrete Optimization Problems with the WOWA Criterion.
Proceedings of the Operations Research Proceedings 2014, 2014

2013
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion.
Oper. Res. Lett., 2013

Approximating the min-max (regret) selecting items problem.
Inf. Process. Lett., 2013

Sequencing Problems with Uncertain Parameters and the OWA Criterion.
Proceedings of the Operations Research Proceedings 2013, 2013

Robust production plan with periodic order quantity under uncertain cumulative demands.
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.
J. Heuristics, 2012

A robust lot sizing problem with ill-known demands.
Fuzzy Sets Syst., 2012

Approximating a two-machine flow shop scheduling under discrete scenario uncertainty.
Eur. J. Oper. Res., 2012

Approximating Combinatorial Optimization Problems with Uncertain Costs and the OWA Criterion.
Proceedings of the Operations Research Proceedings 2012, 2012

Recoverable Robust Combinatorial Optimization Problems.
Proceedings of the Operations Research Proceedings 2012, 2012

Parallel Machine Scheduling under Uncertainty.
Proceedings of the Advances in Computational Intelligence, 2012

Decision Making under Scenario Uncertainty in a Requirement Planning.
Proceedings of the Advances in Computational Intelligence, 2012

2011
Possibilistic Minmax Regret Sequencing Problems With Fuzzy Parameters.
IEEE Trans. Fuzzy Syst., 2011

On the approximability of robust spanning tree problems.
Theor. Comput. Sci., 2011

Possibilistic bottleneck combinatorial optimization problems with ill-known weights.
Int. J. Approx. Reason., 2011

Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios.
Proceedings of the Nonlinear Mathematics for Uncertainty and its Applications, 2011

Min-max and two-stage possibilistic combinatorial optimization problems.
Proceedings of the FUZZ-IEEE 2011, 2011

Production planning with uncertain demands.
Proceedings of the FUZZ-IEEE 2011, 2011

2010
Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems.
Proceedings of the Fuzzy Optimization - Recent Advances and Applications, 2010

Interval PERT and Its Fuzzy Extension.
Proceedings of the Production Engineering and Management under Fuzziness, 2010

Criticality analysis of activity networks under interval uncertainty.
J. Sched., 2010

Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights.
Eur. J. Oper. Res., 2010

2009
On the approximability of minmax (regret) network optimization problems.
Inf. Process. Lett., 2009

Some methods for evaluating the optimality of elements in matroids with ill-known weights.
Fuzzy Sets Syst., 2009

A randomized algorithm for the min-max selecting items problem with uncertain weights.
Ann. Oper. Res., 2009

On Possibilistic Sequencing Problems with Fuzzy Parameters.
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.
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.
Oper. Res. Lett., 2008

On possibilistic combinatorial optimization problems.
Proceedings of the FUZZ-IEEE 2008, 2008

Solving combinatorial optimization problems with fuzzy weights.
Proceedings of the FUZZ-IEEE 2008, 2008

2007
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data.
Oper. Res. Lett., 2007

On combinatorial optimization problems on matroids with uncertain weights.
Eur. J. Oper. Res., 2007

Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems.
Proceedings of the Foundations of Fuzzy Logic and Soft Computing, 2007

Determining Unfuzzy Nondominated Solutions in Combinatorial Optimization Problems with Fuzzy Costs.
Proceedings of the FUZZ-IEEE 2007, 2007

Random Subsets of the Interval and P2P Protocols.
Proceedings of the Approximation, 2007

2006
The robust shortest path problem in series-parallel multidigraphs with interval data.
Oper. Res. Lett., 2006

An approximation algorithm for interval data minmax regret combinatorial optimization problems.
Inf. Process. Lett., 2006

Efficient computation of project characteristics in a series-parallel activity network with interval durations.
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.
Fuzzy Sets Syst., 2005

A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids.
Proceedings of the Fuzzy Logic and Applications, 6th International Workshop, 2005

Efficient Methods for Computing Optimality Degrees of Elements in Fuzzy Weighted Matroids.
Proceedings of the Fuzzy Logic and Applications, 6th International Workshop, 2005

Minimizing a Makespan Under Uncertainty.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Interval Analysis in Scheduling.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
The computational complexity of the relative robust shortest path problem with interval data.
Eur. J. Oper. Res., 2004

2003
On the hardness of evaluating criticality of activities in a planar network with duration intervals.
Oper. Res. Lett., 2003

Latest starting times and floats of activities in network with uncertain durations.
Proceedings of the 3rd Conference of the European Society for Fuzzy Logic and Technology, 2003

2002
On the sure criticality of tasks in activity networks with imprecise durations.
IEEE Trans. Syst. Man Cybern. Part B, 2002

The computational complexity of the criticality problems in a network with interval activity times.
Eur. J. Oper. Res., 2002

2001
Critical path analysis in the network with fuzzy activity times.
Fuzzy Sets Syst., 2001

Criticality analysis in activity networks under incomplete information.
Proceedings of the 2nd International Conference in Fuzzy Logic and Technology, 2001

2000
On the equivalence of two optimization methods for fuzzy linear programming problems.
Eur. J. Oper. Res., 2000

1999
Ranking Fuzzy Interval Numbers in the Setting of Random Sets - Further Results.
Inf. Sci., 1999


  Loading...