dblp.uni-trier.dewww.uni-trier.de

Pawel Zielinski

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
22EEAdam Kasperski, Pawel Zielinski: On the approximability of minmax (regret) network optimization problems. Inf. Process. Lett. 109(5): 262-266 (2009)
2008
21EEAdam Kasperski, Pawel Zielinski: On the approximability of minmax (regret) network optimization problems CoRR abs/0804.0396: (2008)
20EEAdam Kasperski, Pawel Zielinski: A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion. Oper. Res. Lett. 36(3): 343-344 (2008)
2007
19EEJacek Cichon, Marek Klonowski, Lukasz Krzywiecki, Bartlomiej Rózanski, Pawel Zielinski: Random Subsets of the Interval and P2P Protocols. APPROX-RANDOM 2007: 409-421
18EEAdam Kasperski, Pawel Zielinski: Determining Unfuzzy Nondominated Solutions in Combinatorial Optimization Problems with Fuzzy Costs. FUZZ-IEEE 2007: 1-6
17EEAdam Kasperski, Pawel Zielinski: Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems. IFSA (1) 2007: 656-665
16EEAdam Kasperski, Pawel Zielinski: On combinatorial optimization problems on matroids with uncertain weights. European Journal of Operational Research 177(2): 851-864 (2007)
15EEAdam Kasperski, Pawel Zielinski: On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data. Oper. Res. Lett. 35(4): 525-532 (2007)
2006
14EEAdam Kasperski, Pawel Zielinski: An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inf. Process. Lett. 97(5): 177-180 (2006)
13EEAdam Kasperski, Pawel Zielinski: The robust shortest path problem in series-parallel multidigraphs with interval data. Oper. Res. Lett. 34(1): 69-76 (2006)
2005
12EEJérôme Fortin, Pawel Zielinski, Didier Dubois, Hélène Fargier: Interval Analysis in Scheduling. CP 2005: 226-240
11EEJérôme Fortin, Pawel Zielinski, Didier Dubois, Hélène Fargier: Minimizing a Makespan Under Uncertainty. IJCAI 2005: 1519-1520
10EEAdam Kasperski, Pawel Zielinski: A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids. WILF 2005: 46-52
9EEJérôme Fortin, Adam Kasperski, Pawel Zielinski: Efficient Methods for Computing Optimality Degrees of Elements in Fuzzy Weighted Matroids. WILF 2005: 99-107
8EEPawel Zielinski: On computing the latest starting times and floats of activities in a network with imprecise durations. Fuzzy Sets and Systems 150(1): 53-76 (2005)
2004
7EEPawel Zielinski: The computational complexity of the relative robust shortest path problem with interval data. European Journal of Operational Research 158(3): 570-576 (2004)
2003
6EEPawel Zielinski: Latest starting times and floats of activities in network with uncertain durations. EUSFLAT Conf. 2003: 586-591
5EEStefan Chanas, Pawel Zielinski: On the hardness of evaluating criticality of activities in a planar network with duration intervals. Oper. Res. Lett. 31(1): 53-59 (2003)
2002
4 Stefan Chanas, Didier Dubois, Pawel Zielinski: On the sure criticality of tasks in activity networks with imprecise durations. IEEE Transactions on Systems, Man, and Cybernetics, Part B 32(4): 393-407 (2002)
2001
3EEStefan Chanas, Didier Dubois, Pawel Zielinski: Criticality analysis in activity networks under incomplete information. EUSFLAT Conf. 2001: 233-236
2EEStefan Chanas, Pawel Zielinski: Critical path analysis in the network with fuzzy activity times. Fuzzy Sets and Systems 122(2): 195-204 (2001)
1999
1 Stefan Chanas, Pawel Zielinski: Ranking Fuzzy Interval Numbers in the Setting of Random Sets - Further Results. Inf. Sci. 117(3-4): 191-200 (1999)

Coauthor Index

1Stefan Chanas [1] [2] [3] [4] [5]
2Jacek Cichon [19]
3Didier Dubois [3] [4] [11] [12]
4Hélène Fargier [11] [12]
5Jérôme Fortin [9] [11] [12]
6Adam Kasperski [9] [10] [13] [14] [15] [16] [17] [18] [20] [21] [22]
7Marek Klonowski [19]
8Lukasz Krzywiecki [19]
9Bartlomiej Rózanski [19]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)