| An approximation algorithm for interval data minmax regret combinatorial optimization problems A Kasperski, P Zieliński Information Processing Letters 97 (5), 177-180, 2006 | 176 | 2006 |
| Discrete optimization with interval data A Kasperski Springer, 2008 | 133 | 2008 |
| 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 | 120 | 2016 |
| Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion A Kasperski Operations Research Letters 33 (4), 431-436, 2005 | 103 | 2005 |
| Minimizing maximum lateness in a single machine scheduling problem with fuzzy processing times and fuzzy due dates S Chanas, A Kasperski Engineering Applications of Artificial Intelligence 14 (3), 377-386, 2001 | 84 | 2001 |
| 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 | 79 | 2012 |
| 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 | 78 | 2008 |
| On two single machine scheduling problems with fuzzy processing times and fuzzy due dates S Chanas, A Kasperski European Journal of Operational Research 147 (2), 281-296, 2003 | 71 | 2003 |
| 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 | 65 | 2006 |
| On the approximability of robust spanning tree problems A Kasperski, P Zieliński Theoretical Computer Science 412 (4-5), 365-374, 2011 | 53 | 2011 |
| The minimum spanning tree problem with fuzzy costs A Janiak, A Kasperski Fuzzy Optimization and Decision Making 7, 105-118, 2008 | 47 | 2008 |
| Robust recoverable and two-stage selection problems A Kasperski, P Zieliński Discrete Applied Mathematics 233, 52-64, 2017 | 42 | 2017 |
| Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters S Chanas, A Kasperski Fuzzy Sets and Systems 142 (3), 359-371, 2004 | 42 | 2004 |
| On the approximability of minmax (regret) network optimization problems A Kasperski, P Zieliński Information Processing Letters 109 (5), 262-266, 2009 | 41 | 2009 |
| Choosing robust solutions in discrete optimization problems with fuzzy costs A Kasperski, M Kulej Fuzzy Sets and Systems 160 (5), 667-682, 2009 | 40 | 2009 |
| On combinatorial optimization problems on matroids with uncertain weights A Kasperski, P Zieliński European Journal of Operational Research 177 (2), 851-864, 2007 | 39 | 2007 |
| Approximating the min–max (regret) selecting items problem A Kasperski, A Kurpisz, P Zieliński Information Processing Letters 113 (1-2), 23-29, 2013 | 35 | 2013 |
| 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 | 35 | 2010 |
| On recoverable and two-stage robust selection problems with budgeted uncertainty A Chassein, M Goerigk, A Kasperski, P Zieliński European Journal of Operational Research 265 (2), 423-436, 2018 | 33 | 2018 |
| Minmax (regret) scheduling problems A Kasperski, P Zielinski Sequencing and scheduling with inaccurate data, 159-210, 2014 | 33 | 2014 |
Pawel ZielinskiDepartment of Fundamentals of Computer Science, Wroc³aw University of Technology, Wroclaw, PolandVerified email at pwr.edu.pl
