Pawel Zielinski
Pawel Zielinski
Department of Computer Science (W11/K2), Wrocław University of Technology, Wroclaw, Poland
Verified email at pwr.edu.pl - Homepage
Title
Cited by
Cited by
Year
Critical path analysis in the network with fuzzy activity times
S Chanas, P Zieliński
Fuzzy sets and systems 122 (2), 195-204, 2001
2982001
An approximation algorithm for interval data minmax regret combinatorial optimization problems
A Kasperski, P Zieliński
Information Processing Letters 97 (5), 177-180, 2006
1552006
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
1202002
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
1042004
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
1012005
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
962002
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
752000
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
632008
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
572006
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
542003
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
502016
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
422012
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
421999
On the approximability of robust spanning tree problems
A Kasperski, P Zieliński
Theoretical Computer Science 412 (4-5), 365-374, 2011
352011
Criticality analysis of activity networks under interval uncertainty
J Fortin, P Zieliński, D Dubois, H Fargier
Journal of Scheduling 13 (6), 609-627, 2010
352010
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
332010
On combinatorial optimization problems on matroids with uncertain weights
A Kasperski, P Zieliński
European Journal of Operational Research 177 (2), 851-864, 2007
332007
Interval analysis in scheduling
J Fortin, P Zieliński, D Dubois, H Fargier
International Conference on Principles and Practice of Constraint …, 2005
332005
The polar decomposition—properties, applications and algorithms
P Zieliński, K Ziętak
Mathematica Applicanda 24 (38), 23-49, 2016
282016
On the approximability of minmax (regret) network optimization problems
A Kasperski, P Zieliński
Information Processing Letters 109 (5), 262-266, 2009
282009
The system can't perform the operation now. Try again later.
Articles 1–20