List of Publications

Journal and conference papers

(The author names are in alphabetical order):

• M. Jackiewicz, A. Kasperski, P. Zieliński, Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse, Discrete Applied Mathematics, 370 (2025) 103-110. doi: 0.1016/j.dam.2025.03.004
• A. Kasperski, P. Zieliński, Approximating the shortest path problem with scenarios, Theoretical Computer Science, 1025 (2025) 114972. doi: 10.1016/j.tcs.2024.114972
• W. Baak, M. Goerigk, A. Kasperski, P. Zieliński, Robust Min-Max (Regret) Optimization using Ordered Weighted Averaging, European Journal of Operational Research, 322 (2025) 171-181. doi: 10.1016/j.ejor.2024.10.028
• M. Jackiewicz, A. Kasperski, P. Zieliński, Recoverable robust shortest path problem under interval budgeted uncertainty representations, Networks, 85 (2025) 127-141. doi: 10.1002/net.22255
• R. Guillaume , A. Kasperski, S. Wróbel, P. Zieliński, Using the R* Criterion to Selected Optimization Problems Under Uncertainty, In: Glomb, L. (eds) Operations Research Proceedings 2024. OR 2024, Lecture Notes in Operations Research. Springer, Cham, 2025, 377-382. doi:10.1007/978-3-031-92575-7_54
• M. Jackiewicz, A. Kasperski, P. Zieliński, Solving Wasserstein Distributionally Robust Combinatorial Optimization Problems, In: Voigt, G., Fliedner, M., Haase, K., Brüggemann, W., Hoberg, K., Meissner, J. (eds) Operations Research Proceedings 2023. OR 2023, Lecture Notes in Operations Research. Springer, Cham, 2025, 115-121. doi:10.1007/978-3-031-58405-3_15
• M. Jackiewicz, A. Kasperski, P. Zieliński, Solving the Recoverable Robust Shortest Path Problem in DAGs, In: Voigt, G., Fliedner, M., Haase, K., Brüggemann, W., Hoberg, K., Meissner, J. (eds) Operations Research Proceedings 2023. OR 2023, Lecture Notes in Operations Research. Springer, Cham, 2025, 161-167. doi:10.1007/978-3-031-58405-3_21
• R. Guillaume , A. Kasperski, P. Zieliński, A framework of distributionally robust possibilistic optimization, Fuzzy Optimization and Decision Making, 23 (2024) 253-278. doi: 10.1007/s10700-024-09420-2
• R. Guillaume , A. Kasperski, P. Zieliński, Lot sizing problem under lead-time uncertainty. In M.-J. Lesot, S. Vieira, M. Z. Reformat, J. P. Carvalho, F. Batista, B. Bouchon-Meunier, and R. R. Yager, editors, Information Processing and Management of Uncertainty in Knowledge-Based Systems, (IPMU 2024) volume 1174 of Lecture Notes in Networks and Systems, pages 138-149, Springer, 2024. doi: 10.1007/978-3-031-74003-9_12
• A. Kasperski, P. Zieliński, Recoverable Possibilistic Linear Programming, Proceedings of IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2024, Yokohama, Japan, June 30 - July 5, 2024, 1-8. doi: 10.1109/FUZZ-IEEE60900.2024.10612017
• M. Goerigk, R. Guillaume , A. Kasperski, P. Zieliński, Robust optimization with belief functions, International Journal of Approximate Reasoning, 159 (2023) 108941. doi: 10.1016/j.ijar.2023.108941
• R. Guillaume , A. Kasperski, P. Zieliński, Distributionally robust possibilistic optimization problems, Fuzzy Sets and Systems, 454 (2023) 56-73. doi: 10.1016/j.fss.2022.05.007
• R. Guillaume , A. Kasperski, P. Zieliński, Robust inventory problem with budgeted cumulative demand uncertainty, Optimization Letters, 16 (2022) 2543-2556. doi: 10.1007/s11590-022-01875-9
• M. Goerigk, A. Kasperski, P. Zieliński, Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty, Journal of Combinatorial Optimization, 43 (2022) 497-527. doi: 10.1007/s10878-021-00776-4
• R. Guillaume , A. Kasperski, P. Zieliński, Robust Optimization with Scenarios Using Belief Functions, in: Trautmann, N., Gnägi, M. (eds) Operations Research Proceedings 2021, OR 2021, Lecture Notes in Operations Research. Springer, Cham, 2022, 114-119. doi:10.1007/978-3-031-08623-6_18
• A. Kasperski, P. Zieliński, Soft robust solutions to possibilistic optimization problems, Fuzzy Sets and Systems, 422 (2021) 130-148. doi: 10.1016/j.fss.2020.12.016
• M. Goerigk, A. Kasperski, P. Zieliński, Combinatorial two-stage minmax regret problems under interval uncertainty, Annals of Operations Research, 300 (2021) 23-50. doi: 10.1007/s10479-020-03863-7
• R. Guillaume , A. Kasperski, P. Zieliński, Distributionally robust optimization in possibilistic setting, Proceedings of the 2021 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2021, Luxembourg, July 11-14, 2021, 1-6. doi: 10.1109/FUZZ45933.2021.9494390
• R. Guillaume , A. Kasperski, P. Zieliński, Robust optimization with scenarios using random fuzzy sets, Proceedings of the 2021 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2021, Luxembourg, July 11-14, 2021, 1-6. doi: 10.1109/FUZZ45933.2021.9494494
• A. Chassein, M. Goerigk, A. Kasperski, P. Zieliński, Approximating combinatorial optimization problems with the ordered weighted averaging criterion, European Journal of Operational Research, 286 (2020) 828-838. doi: 10.1016/j.ejor.2020.04.018
• M. Goerigk, A. Kasperski, P. Zieliński, Two-stage Combinatorial Optimization Problems under Risk, Theoretical Computer Science, 804 (2020) 29-45. doi: 10.1016/j.tcs.2019.10.035
• R. Guillaume , A. Kasperski, P. Zieliński, Robust Possibilistic Production Planning Under Budgeted Demand Uncertainty, Proceedings of the 2020 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2020, Glasgow, UK, July 19-24 2020, 1-8. doi: 10.1109/FUZZ48607.2020.9177596
• R. Guillaume , A. Kasperski, P. Zieliński, Softening the robustness of optimization problems: A new budgeted uncertainty approach. In M.-J. Lesot, S. Vieira, M. Z. Reformat, J. P. Carvalho, A. Wilbik, B. Bouchon-Meunier, and R. R. Yager, editors, Information Processing and Management of Uncertainty in Knowledge-Based Systems, pages 187-200, Cham, 2020. Springer International Publishing. doi: 10.1007/978-3-030-50146-4_15
• M. Goerigk, A. Kasperski, P. Zieliński, Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty, Operations Research Proceedings 2019, J.S Neufeld et al. (eds.), Springer, Switzerland, 2020, 423-429. doi:10.1007/978-3-030-48439-2_51
• R. Guillaume , A. Kasperski, P. Zieliński, Production Planning Under Demand Uncertainty: A Budgeted Uncertainty Approach, Operations Research Proceedings 2019, J.S Neufeld et al. (eds.), Springer, Switzerland, 2020, 431-437. doi:10.1007/978-3-030-48439-2_52
• A. Kasperski, P. Zieliński, A (Soft) Robustness for Possibilistic Optimization Problems, Proceedings of the 2019 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2019, New Orleans, Louisiana, USA, June 23-26 2019, 1-6. doi: 10.1109/FUZZ-IEEE.2019.8858834
• M. Hradovich, A. Kasperski, P. Zieliński, Robust recoverable 0-1 optimization problems under polyhedral uncertainty, European Journal of Operational Research, 278 (2019) 136-148. doi: 10.1016/j.ejor.2019.04.017
• A. Kasperski, P. Zieliński, Risk averse single machine scheduling - complexity and approximation, Journal of Scheduling. 22 (2019) 567-580. doi: 10.1007/s10951-019-00599-6
• A. Chassein, M. Goerigk, A. Kasperski, P. Zieliński, On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty, European Journal of Operational Research, 265 (2018) 423-436. doi: 10.1016/j.ejor.2017.08.013
• M. Hradovich, A. Kasperski, P. Zieliński, Risk averse scheduling with scenarios, in: Operations Research Proceedings 2017, N. Kliewer et al. (eds.), Springer, Switzerland, 2018, 435-441. doi:10.1007/978-3-319-89920-6_58
• R. Guillaume , C. Thierry, P. Zieliński, Robust material requirement planning with cumulative demand under uncertainty, International Journal of Production Research, 55 (2017) 6824-6845. doi: 10.1080/00207543.2017.1353157
• A. Kasperski, P. Zieliński, Robust recoverable and two-stage selection problems, Discrete Applied Mathematics, 233 (2017) 52-64. doi: 10.1016/j.dam.2017.08.014
• M. Hradovich, A. Kasperski, P. Zieliński, Recoverable robust spanning tree problem under interval uncertainty representations, Journal of Combinatorial Optimization, 34 (2017) 554-573. doi: 10.1007/s10878-016-0089-6
• A. Kasperski, P. Zieliński, Robust Two-Stage Network Problems, in: Operations Research Proceedings 2015, K. F. Doerner et al. (eds.), Springer, Switzerland, 2017, 35-40. doi:10.1007/978-3-319-42902-1_5
• M. Hradovich, A. Kasperski, P. Zieliński, The recoverable robust spanning tree problem with interval costs is polynomially solvable, Optimization Letters, 11 (2017) 17-30. doi: 10.1007/s11590-016-1057-x
• A. Kasperski, P. Zieliński, A robust approach to a class of uncertain optimization problems with imprecise probabilities, Proceedings of the 2016 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2016, Vancouver, Canada, July 24-29 2016, 1606-1613. doi: 10.1109/FUZZ-IEEE.2016.7737882
• A. Kasperski, P. Zieliński, Robust Discrete Optimization Under Discrete and Interval Uncertainty: A Survey, in: Robustness Analysis in Decision Aiding, Optimization, and Analytics, M. Doumpos et al. (eds.), International Series in Operations Research & Management Science 241, Springer, Switzerland, 2016, 113-143. doi: 10.1007/978-3-319-33121-8_6
• A. Kasperski, P. Zieliński, Single machine scheduling problems with uncertain parameters and the OWA criterion, Journal of Scheduling, 19 (2016) 177-190. doi: 10.1007/s10951-015-0444-y
• A. Kasperski, P. Zieliński, Using the WOWA operator in robust discrete optimization problems, International Journal of Approximate Reasoning, 68 (2016) 54-67. doi: 10.1016/j.ijar.2015.10.005
• A. Kasperski, P. Zieliński, Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion, in: Operations Research Proceedings 2014, M. Lubbecke et al. (eds.), Springer, Switzerland, 2016, 279-284. doi:10.1007/978-3-319-28697-6_39
• A. Kasperski, P. Zieliński, Robust Discrete Optimization Problems with the WOWA Criterion, in: Operations Research Proceedings 2014, M. Lubbecke et al. (eds.), Springer, Switzerland, 2016, 271-277. doi:10.1007/978-3-319-28697-6_38
• A. Kiełbasiński, P. Zieliński, K. Ziętak, On iterative algorithms for the polar decomposition of a matrix and the matrix sign function, Applied Mathematics and Computation, 270 (2015) 483-495. doi: 10.1016/j.amc.2015.08.004
• A. Kasperski, P. Zieliński, Complexity of the robust weighted independent set problems on interval graphs, Optimization Letters, 9 (2015) 427-436. doi:10.1007/s11590-014-0773-3
• A. Kasperski, P. Zieliński, Combinatorial optimization problems with uncertain costs and the OWA criterion, Theoretical Computer Science, 565 (2015) 102-112. doi:10.1016/j.tcs.2014.11.013
• A. Kasperski, A. Kurpisz, P. Zieliński, Approximability of the robust representatives selection problem, Operations Research Letters, 43 (2015) 16-19. doi:10.1016/j.orl.2014.10.007
• A. Kasperski, P. Zieliński, Sequencing problems with uncertain parameters and the OWA criterion, in: Operations Research Proceedings 2013, D. Huisman et al. (eds.), Springer, Switzerland, 2014, 223-229. doi:10.1007/978-3-319-07001-8_30
• A. Kasperski, P. Zieliński, Minmax (regret) scheduling problems, in: Sequencing and Scheduling with Inaccurate Data, Y. N. Sotskov, F. Werner (Eds.), Nova Science Publishers, New York, 2014, 159-210.
• A. Kasperski, P. Zieliński, Approximating combinatorial optimization problems with uncertain costs and the OWA criterion, in: Operations Research Proceedings 2012, S. Helber et al. (eds.), Springer, Switzerland, 2014, 141-146. doi:10.1007/978-3-319-00795-3_21
• A. Kasperski, A. Kurpisz, P. Zieliński, Recoverable robust combinatorial optimization problems, in: Operations Research Proceedings 2012, S. Helber et al. (eds.), Springer, Switzerland, 2014, 147-153. doi:10.1007/978-3-319-00795-3_22
• A. Kasperski, P. Zieliński, Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion, Operations Research Letters, 41 (2013) 639-643. doi:10.1016/j.orl.2013.08.014
• R. Guillaume , C. Thierry, P. Zieliński, Robust Production Plan with Periodic Order Quantity under Uncertain Cumulative Demands, Proceedings of the 10th IEEE International Conference on Networking, Sensing and Control, April 10-12, 2013, Paris, France, 294-299.
• A. Kasperski, A. Kurpisz, P. Zieliński, Approximating the minmax (regret) selecting items problem, Information Processing Letters, 113 (2013) 23-29. doi:10.1016/j.ipl.2012.10.001
• R. Guillaume , P. Kobylański, P. Zieliński, A Robust Lot Sizing Problem with Ill-known Demands, Fuzzy Sets and Systems, 206 (2012) 39-57. doi:10.1016/j.fss.2012.01.015
• A. Kasperski, M. Makuchowski, P. Zieliński, A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data, Journal of Heuristics, 18 (2012) 593-625. doi:10.1007/s10732-012-9200-z
• R. Guillaume , P. Zieliński, Decision making under scenario uncertainty in a requirement planning. In S. Greco, B. Bouchon-Meunier, G. Coletti, M. Fedrizzi, B. Matarazzo, and R. R. Yager (Eds.), Advances in Computational Intelligence , volume 300 of Communications in Computer and Information Science, pages 104-113. Springer, 2012.
• A. Kasperski, A. Kurpisz, P. Zieliński, Parallel machine scheduling under uncertainty. In S. Greco, B. Bouchon-Meunier, G. Coletti, M. Fedrizzi, B. Matarazzo, and R. R. Yager (Eds.), Advances in Computational Intelligence, volume 300 of Communications in Computer and Information Science, pages 74-83. Springer, 2012.
• A. Kasperski, A. Kurpisz, P. Zieliński, Approximating a two-machine flow shop scheduling under discrete scenario uncertainty, European Journal of Operational Research, 217 (2012) 36-43. doi:10.1016/j.ejor.2011.08.029
• A. Kasperski, P. Zieliński, Possibilistic Minmax Regret Sequencing Problems with Fuzzy Parameters, IEEE Transactions on Fuzzy Systems, 19 (2011) 1072-1082. doi:10.1109/TFUZZ.2011.2159982
• A. Kasperski, P. Zieliński, Possibilistic Bottleneck Combinatorial Optimization Problems with Ill-known Weights, International Journal of Approximate Reasoning, 52 (2011) 298-1311. doi:10.1016/j.ijar.2011.01.003
• A. Kasperski, P. Zieliński, Bottleneck combinatorial optimization problems with fuzzy scenarios, in: Nonlinear Mathematics for Uncertainty and its Applications, S. Li, X. Wang, Y. Okazaki, J. Kawabe, T. Murofushi, and L. Guan (Eds.), Springer Verlag Berlin/Heidelberg, 2011, ISBN 978-3-642-22832-2, 197-204.
• A. Kasperski, P. Zieliński, Min-Max and Two-Stage Possibilistic Combinatorial Optimization Problems, Proceedings of the 2011 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2011, June 27-30, 2011, Taipei, Taiwan, 2650-2655.
• R. Guillaume , P. Kobylański, P. Zieliński, Production Planning with Uncertain Demands, Proceedings of the 2011 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2011, June 27-30, 2011, Taipei, Taiwan, 2644-2649.
• A. Kasperski, P. Zieliński, On the approximability of robust spanning tree problems, Theoretical Computer Science, 412 (2011) 365-374.
• J. Fortin, P. Zieliński, D. Dubois, H. Fargier, Criticality analysis of activity networks under interval uncertainty, Journal of Scheduling, 13 (2010) 609-627.
• D. Dubois, J. Fortin, P. Zieliński, Interval PERT and Its Fuzzy Extension, in: Production Engineering and Management under Fuzziness, C. Kahraman and M. Yavuz (eds.), Springer Verlag Berlin/Heidelberg, 2010, ISBN 978-3-642-12051-0, 171-199.
• A. Kasperski , P. Zieliński, Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems, in: Fuzzy Optimization, Studies in Fuzziness and Soft Computing, W.A. Lodwick and J. Kacprzyk (eds.), Springer Verlag Berlin/Heidelberg, 2010, 287-312.
• A. Kasperski , P. Zieliński, Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights, European Journal of Operational Research, 200 (2010) 680-687.
• A. Kasperski , P. Zieliński, A randomized algorithm for the min-max selecting items problem with uncertain weights, Annals of Operations Research, 172 (2009) 221-230.
• A. Kasperski, P. Zieliński, On the approximability of minmax (regret) network optimization problems, Information Processing Letters, 109 (2009) 262-266.
• J. Fortin, A. Kasperski, P. Zieliński, Some methods for evaluating the optimality of elements in matroids with ill-known weights, Fuzzy Sets and Systems, 160 (2009) 1341-1354.
• A. Kasperski, P. Zieliński, A possibilistic approach to bottleneck combinatorial optimization problems with Ill-known weights, Proceedings of the 2009 IFSA World Congress and 2009 EUSFLAT Conference 20-24 July, 2009, Lisbon, Portugal, 390-395.
• A. Kasperski, P. Zieliński, On possibilistic sequencing problems with fuzzy parameters, Proceedings of the 2009 IFSA World Congress and 2009 EUSFLAT Conference 20-24 July, 2009, Lisbon, Portugal, 426-431.
• A. Kasperski, P. Zieliński, On Possibilistic Combinatorial Optimization Problems, Proceedings of the 2008 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2008, 1-6 June, 2008, Hong Kong, IEEE Computational Intelligence Society, 324-329.
• A. Kasperski, P. Zieliński, Solving Combinatorial Optimization Problems with Fuzzy Weights, Proceedings of the 2008 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2008, 1-6 June, 2008, Hong Kong, IEEE Computational Intelligence Society, 318-323.
• A. Kasperski , P. Zieliński, A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion, Operations Research Letters, 36 (2008) 343-344.
• J. Cichoń, M. Klonowski, Ł. Krzywiecki, B. Różański, P. Zieliński, Random Subsets of the Interval and P2P Protocols, in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, M. Charikar, K. Jansen, O. Reingold, J. D. P. Rolim (eds.), LNCS 4627, Springer Verlag, Berlin 2007, 409-421.
• A. Kasperski, P. Zieliński, Determining Unfuzzy Nondominated Solutions in Combinatorial Optimization Problems with Fuzzy Costs. Proceedings of the 2007 IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2007, Imperial College, London, UK 23-26 July, 2007, IEEE Computational Intelligence Society, 292-297.
• A. Kasperski, P. Zieliński, Using gradual numbers for solving fuzzy-valued combinatorial optimization problems in: IFSA 2007, P. Melin, O. Castillo, L.T. Aguilar, J. Kacprzyk, W. Pedrycz (eds.), LNCS/LNAI 4529, Springer-Verlag, Berlin 2007, 656-665.
• A. Kasperski , P. Zieliński, On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data, Operations Research Letters, 35 (2007) 525-532.
• A. Kasperski , P. Zieliński, On combinatorial optimization problems on matroids with uncertain weights, European Journal of Operational Research, 177 (2007) 851-864.
• A. Kasperski, P. Zieliński, An approximation algorithm for interval data minmax regret combinatorial optimization problems, Information Processing Letters, 97 (2006) 177-180.
• A. Kasperski, P. Zieliński, A possibilistic approach to combinatorial optimization problems on fuzzy-valued matroids, in: WILF 2005, I. Bloch, A. Petrosino, A. Tettamanzi (eds.), LNCS/LNAI 3849, Springer-Verlag, Berlin 2006, 46-52.
• J. Fortin, A. Kasperski, P. Zieliński, Efficient methods for computing optimality degrees of elements in fuzzy weighted matroids, in: WILF 2005, I. Bloch, A. Petrosino, A. Tettamanzi (eds.), LNCS/LNAI 3849, Springer-Verlag, Berlin 2006, 99-107.
• P. Zieliński, Efficient computation of project characteristics in a series-parallel activity network with interval durations, in: Decision Theory and Multi-Agent Planning, G. Della Riccia, D. Dubois, R. Kruse, H.J. Lenz (eds.), CISM Courses and Lectures no. 482, Springer-Verlag, Wien, New York, 2006.
• A. Kasperski , P. Zieliński, The robust shortest path problem in series-parallel multidigraphs with interval data, Operations Research Letters. 34 (2006) 69-76.
• J. Fortin, P. Zieliński, D. Dubois, H. Fargier, Interval analysis in scheduling, in: Principles and Practice of Constraint Programming - CP 2005 11th International Conference, CP 2005, P. van Beek (Ed.), LNCS 3709, Springer Verlag, Berlin 2005, 226 - 240.
• J. Fortin, P. Zieliński, D. Dubois, H. Fargier, Minimising a Makespan Under Uncertainty. Proceedings of Nineteenth International Joint Conference on Artificial Intelligence 2005, IJCAI-05, Edinburgh, Scotland, July 30-August 5, 2005, 1519-1520, Poster paper.
• A. Kasperski , P. Kobylański, M. Kulej, P. Zieliński, Minimizing maximal regret in discrete optimization problems with interval data, in: Issues in Soft Computing. Decisions and Operations Research, O. Hryniewicz, J. Kacprzyk, D. Kuchta (eds.), Akademicka Oficyna Wydawnicza EXIT, Warszawa, 2005, 191-208.
• P. Zieliński, On computing the latest starting times and floats of activities in a network with imprecise durations, Fuzzy Sets and Systems, 150 (2005) 53-76.
• P. Zieliński, The computational complexity of the relative robust shortest path problem with interval data, European Journal of Operational Research, 158 (2004) 570-576.
• P. Zieliński, A linear time algorithm to compute floats in a series-parallel network with duration intervals, in: Soft Computing - Tools, Techniques and applications, P. Grzegorzewski, M. Krawczak, S. Zadrożny (eds.), Akademicka Oficyna Wydawnicza EXIT, Warszawa, 2004, 401-414.
• P. Zieliński, Computing efficiently floats of all activities in a series-parallel network with duration intervals, Operations Research and Decisions. 4 (2003) 185-208.
• P. Zieliński, Latest starting times and floats of activities in networks with uncertain durations, Proceedings of An International Conference in Fuzzy Logic and Technology, Eusflat 2003, 10-12 September 2003, Zittau, Germany, 586-591.
• S. Chanas, P. Zieliński, On the hardness of evaluating criticality of activities in a planar network with duration intervals, Operations Research Letters, 31 (2003) 53-59.
• S. Chanas, P. Zieliński, Krytyczność w sieciach z przedziałowymi i rozmytymi czasami wykonania czynności, W: Badania operacyjne i systemowe wobec wyzwań XXI wieku, Modelowanie i optymalizacja - metody i zastosowania, pod red. J. Kacprzyka i J. Węglarza, Akademicka Oficyna Wydawnicza EXIT, Warszawa 2002, s. III-31 - III-41.
• S. Chanas, D. Dubois, P. Zieliński, On the sure criticality of tasks in activity networks with imprecise durations, IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics, 32 (2002) 393-407.
• P. Kobylański, P. Zieliński, Fuzzy modeling with constraint technology , Proceedings of EUROFUSE 2002, 7-th Meeting of the EURO Working Group on Fuzzy Sets, Workshop on Information Systems September 23-25 2002, Varenna, Italy, 93-98.
• S. Chanas, P. Zieliński, The computational complexity of the criticality problems in a network with interval activity times, European Journal of Operational Research, 136 (2002) 541-550.
• S. Chanas, P. Zieliński, Criticality in the Network with Imprecise Activity Times (extended version), in: Technologies for Constructing Intelligent Systems 1: Tasks, Bouchon-Meunier, J. Gutierrez, L. Magdalena, R.R. Yager (eds.), Physica-Verlag, A Springer-Verlag Co. Heidelberg 2002, ISBN 3-7908-1454-7, 71-84.
• S. Chanas, D. Dubois, P. Zieliński, Criticality analysis in activity networks under incomplete information, Proceedings of An International Conference in Fuzzy Logic and Technology, Eusflat 2001, 5-7 September 2001, De Montfort University Leicester, UK, 233-236.
• S. Chanas, P. Zieliński, Critical path analysis in the network with fuzzy activity times, Fuzzy Sets and Systems, 122 (2001) 195-204.
• S. Chanas, P. Zieliński, On the equivalence of two optimization methods for fuzzy linear programming problems, European Journal of Operational Research, 121 (2000) 56-63.
• S. Chanas, P. Zieliński, Criticality in the Network with Imprecise Activity Times, Proceedings of 8-th International Conference on Information processing and management of uncertainty in knowledge-based systems. IPMU July 3-7 2000, Madrid Spain, 1233-1238.
• S. Chanas, P. Zieliński, Ranking Fuzzy Interval Numbers in the Setting of Random Sets - Further Results, Information Sciences, 117 (1999) 191-200.
• S. Chanas, P. Zieliński, Zadanie programowania liniowego z rozmytym współlczynnikami w funkcji celu, W: Metody i Zastosowania Badań Operacyjnych, pod red. T. Trzaskalika, Akademia Ekonomiczna, Katowice 1998, s. 222-231
• S. Chanas, P. Zieliński, Unfuzzy non dominated solutions in the linear programming problem with fuzzy coefficients in the objective function, The Journal of Fuzzy Mathematics, 5 (1997) 115-131.
• P. Zieliński, Równoległy algorytm wyżarzania genetycznego wyznaczania punktu siodłowego, Materiały XV Ogólnopolskiej Konferencji Polioptymalizacja i Komputerowe Wspomaganie Projektowania, Mielno'1997, s. 339-346.
• P. Zieliński, K. Ziętak, The polar decomposition - properties, applications and algorithms, Mathematica Applicanda, 38 (1995) 23-49.

Technical reports and submitted papers:

• A. Kiełbasiński, P. Zieliński, K. Ziętak, Higham's scaled method for polar decomposition and numerical matrix-inversion, Instytut Matematyki i Informatyki PWroc., Wrocław 2007, raport serii PREPRINTY nr 45.
• A. Kiełbasiński, P. Zieliński, K. Ziętak, Numerical experiments with Higham's scaled method for polar decomposition, Instytut Matematyki i Informatyki PWroc., Wrocław 2006, raport serii PREPRINTY nr 13.
• A. Kasperski , P. Zieliński, Minimizing maximal regret in the linear assignment problems with interval costs, Instytut Matematyki PWroc., Wrocław 2004, raport serii PREPRINTY nr 7.
• D. Dubois, H. Fargier, V. Galvagnon, ave la collaboration de S. Chanas, Ph. Fortemps, et P. Zieliński, Scheduling under uncertainty: a possibility-theoretic approach, Institut de Recherche en Informatique de Toulouse, rapport IRIT/01-10 R, Juin 2001.

orcid.org/0000-0002-1466-2887