| Critical path analysis in the network with fuzzy activity times S Chanas, P Zieliński Fuzzy sets and systems 122 (2), 195-204, 2001 | 373 | 2001 |
| An approximation algorithm for interval data minmax regret combinatorial optimization problems A Kasperski, P Zieliński Information Processing Letters 97 (5), 177-180, 2006 | 171 | 2006 |
| The computational complexity of the criticality problems in a network with interval activity times S Chanas, P Zieliński European Journal of Operational Research 136 (3), 541-550, 2002 | 125 | 2002 |
| On computing the latest starting times and floats of activities in a network with imprecise durations P Zieliński Fuzzy sets and Systems 150 (1), 53-76, 2005 | 124 | 2005 |
| Robust discrete optimization under discrete and interval uncertainty: A survey A Kasperski, P Zieliński Robustness analysis in decision aiding, optimization, and analytics, 113-143, 2016 | 114 | 2016 |
| The computational complexity of the relative robust shortest path problem with interval data P Zieliński European Journal of Operational Research 158 (3), 570-576, 2004 | 111 | 2004 |
| On the sure criticality of tasks in activity networks with imprecise durations S Chanas, D Dubois, P Zielinski IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) 32 …, 2002 | 108 | 2002 |
| On the equivalence of two optimization methods for fuzzy linear programming problems S Chanas, P Zieliński European Journal of Operational Research 121 (1), 56-63, 2000 | 83 | 2000 |
| A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion A Kasperski, P Zieliński Operations Research Letters 36 (3), 343-344, 2008 | 77 | 2008 |
| Approximating a two-machine flow shop scheduling under discrete scenario uncertainty A Kasperski, A Kurpisz, P Zieliński European Journal of Operational Research 217 (1), 36-43, 2012 | 75 | 2012 |
| The robust shortest path problem in series–parallel multidigraphs with interval data A Kasperski, P Zieliński Operations Research Letters 34 (1), 69-76, 2006 | 63 | 2006 |
| On the hardness of evaluating criticality of activities in a planar network with duration intervals S Chanas, P Zieliński Operations Research Letters 31 (1), 53-59, 2003 | 56 | 2003 |
| On the approximability of robust spanning tree problems A Kasperski, P Zieliński Theoretical Computer Science 412 (4-5), 365-374, 2011 | 50 | 2011 |
| Criticality analysis of activity networks under interval uncertainty J Fortin, P Zieliński, D Dubois, H Fargier Journal of Scheduling 13, 609-627, 2010 | 49 | 2010 |
| Robust material requirement planning with cumulative demand under uncertainty R Guillaume, C Thierry, P Zieliński International Journal of Production Research 55 (22), 6824-6845, 2017 | 44 | 2017 |
| Ranking fuzzy interval numbers in the setting of random sets–further results S Chanas, P Zieliński Information Sciences 117 (3-4), 191-200, 1999 | 44 | 1999 |
| Robust recoverable and two-stage selection problems A Kasperski, P Zieliński Discrete Applied Mathematics 233, 52-64, 2017 | 40 | 2017 |
| On combinatorial optimization problems on matroids with uncertain weights A Kasperski, P Zieliński European Journal of Operational Research 177 (2), 851-864, 2007 | 38 | 2007 |
| Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights A Kasperski, P Zieliński European Journal of Operational Research 200 (3), 680-687, 2010 | 36 | 2010 |
| On the approximability of minmax (regret) network optimization problems A Kasperski, P Zieliński Information Processing Letters 109 (5), 262-266, 2009 | 36 | 2009 |
Adam KasperskiDepartment of Operations Research, Wroclaw University of Science and TechnologyZweryfikowany adres z pwr.edu.pl
