Wroclaw University of Technology, Poland
List of publications from the DBLP Bibliography Server - FAQother persons with the same name:
- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j25 |      | Adam Kasperski, Adam Kurpisz, Pawel Zielinski: Approximating the min-max (regret) selecting items problem. Inf. Process. Lett. 113(1-2): 23-29 (2013) |
| 2012 | ||
| j24 | | Adam Kasperski, Adam Kurpisz, Pawel Zielinski: Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. European Journal of Operational Research 217(1): 36-43 (2012) |
| j23 | | Romain Guillaume, Przemyslaw Kobylanski, Pawel Zielinski: A robust lot sizing problem with ill-known demands. Fuzzy Sets and Systems 206: 39-57 (2012) |
| j22 | | Adam Kasperski, Mariusz Makuchowski, Pawel Zielinski: A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data. J. Heuristics 18(4): 593-625 (2012) |
| c18 | | Adam Kasperski, Adam Kurpisz, Pawel Zielinski: Parallel Machine Scheduling under Uncertainty. IPMU (4) 2012: 74-83 |
| c17 | | Romain Guillaume, Pawel Zielinski: Decision Making under Scenario Uncertainty in a Requirement Planning. IPMU (4) 2012: 104-113 |
| i3 | | Romain Guillaume, Przemyslaw Kobylanski, Pawel Zielinski: A Robust Lot Sizing Problem with Ill-known Demands. CoRR abs/1210.5386 (2012) |
| 2011 | ||
| j21 | | Adam Kasperski, Pawel Zielinski: Possibilistic bottleneck combinatorial optimization problems with ill-known weights. Int. J. Approx. Reasoning 52(9): 1298-1311 (2011) |
| j20 | | Adam Kasperski, Pawel Zielinski: On the approximability of robust spanning tree problems. Theor. Comput. Sci. 412(4-5): 365-374 (2011) |
| j19 | | Adam Kasperski, Pawel Zielinski: Possibilistic Minmax Regret Sequencing Problems With Fuzzy Parameters. IEEE T. Fuzzy Systems 19(6): 1072-1082 (2011) |
| c16 | | Romain Guillaume, Przemyslaw Kobylanski, Pawel Zielinski: Production planning with uncertain demands. FUZZ-IEEE 2011: 2644-2649 |
| c15 | | Adam Kasperski, Pawel Zielinski: Min-max and two-stage possibilistic combinatorial optimization problems. FUZZ-IEEE 2011: 2650-2655 |
| c14 | | Adam Kasperski, Pawel Zielinski: Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios. NL-MUA 2011: 197-204 |
| 2010 | ||
| j18 | | Adam Kasperski, Pawel Zielinski: Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights. European Journal of Operational Research 200(3): 680-687 (2010) |
| j17 | | Jérôme Fortin, Pawel Zielinski, Didier Dubois, Hélène Fargier: Criticality analysis of activity networks under interval uncertainty. J. Scheduling 13(6): 609-627 (2010) |
| p2 | | Didier Dubois, Jérôme Fortin, Pawel Zielinski: Interval PERT and Its Fuzzy Extension. Production Engineering and Management under Fuzziness 2010: 171-199 |
| p1 | | Adam Kasperski, Pawel Zielinski: Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems. Fuzzy Optimization 2010: 287-312 |
| i2 | | Adam Kasperski, Pawel Zielinski: On the approximability of robust spanning tree problems. CoRR abs/1004.2891 (2010) |
| 2009 | ||
| j16 | | Adam Kasperski, Pawel Zielinski: A randomized algorithm for the min-max selecting items problem with uncertain weights. Annals OR 172(1): 221-230 (2009) |
| j15 | | Jérôme Fortin, Adam Kasperski, Pawel Zielinski: Some methods for evaluating the optimality of elements in matroids with ill-known weights. Fuzzy Sets and Systems 160(10): 1341-1354 (2009) |
| j14 | | Adam Kasperski, Pawel Zielinski: On the approximability of minmax (regret) network optimization problems. Inf. Process. Lett. 109(5): 262-266 (2009) |
| c13 | | Adam Kasperski, Pawel Zielinski: A Possibilistic Approach to Bottleneck Combinatorial Optimization Problems with Ill-Known Weights. IFSA/EUSFLAT Conf. 2009: 390-395 |
| c12 | | Adam Kasperski, Pawel Zielinski: On Possibilistic Sequencing Problems with Fuzzy Parameters. IFSA/EUSFLAT Conf. 2009: 426-431 |
| 2008 | ||
| j13 | | Adam 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) |
| c11 | | Adam Kasperski, Pawel Zielinski: Solving combinatorial optimization problems with fuzzy weights. FUZZ-IEEE 2008: 318-323 |
| c10 | | Adam Kasperski, Pawel Zielinski: On possibilistic combinatorial optimization problems. FUZZ-IEEE 2008: 324-329 |
| i1 | | Adam Kasperski, Pawel Zielinski: On the approximability of minmax (regret) network optimization problems. CoRR abs/0804.0396 (2008) |
| 2007 | ||
| j12 | | Adam Kasperski, Pawel Zielinski: On combinatorial optimization problems on matroids with uncertain weights. European Journal of Operational Research 177(2): 851-864 (2007) |
| j11 | | Adam 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) |
| c9 | | Jacek Cichon, Marek Klonowski, Lukasz Krzywiecki, Bartlomiej Rózanski, Pawel Zielinski: Random Subsets of the Interval and P2P Protocols. APPROX-RANDOM 2007: 409-421 |
| c8 | | Adam Kasperski, Pawel Zielinski: Determining Unfuzzy Nondominated Solutions in Combinatorial Optimization Problems with Fuzzy Costs. FUZZ-IEEE 2007: 1-6 |
| c7 | | Adam Kasperski, Pawel Zielinski: Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems. IFSA (1) 2007: 656-665 |
| 2006 | ||
| j10 | | Adam Kasperski, Pawel Zielinski: An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inf. Process. Lett. 97(5): 177-180 (2006) |
| j9 | | Adam Kasperski, Pawel Zielinski: The robust shortest path problem in series-parallel multidigraphs with interval data. Oper. Res. Lett. 34(1): 69-76 (2006) |
| 2005 | ||
| j8 | | Pawel 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) |
| c6 | | Jérôme Fortin, Pawel Zielinski, Didier Dubois, Hélène Fargier: Interval Analysis in Scheduling. CP 2005: 226-240 |
| c5 | | Jérôme Fortin, Pawel Zielinski, Didier Dubois, Hélène Fargier: Minimizing a Makespan Under Uncertainty. IJCAI 2005: 1519-1520 |
| c4 | | Adam Kasperski, Pawel Zielinski: A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids. WILF 2005: 46-52 |
| c3 | | Jérôme Fortin, Adam Kasperski, Pawel Zielinski: Efficient Methods for Computing Optimality Degrees of Elements in Fuzzy Weighted Matroids. WILF 2005: 99-107 |
| 2004 | ||
| j7 | | Pawel 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 | ||
| j6 | | Stefan 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) |
| c2 | | Pawel Zielinski: Latest starting times and floats of activities in network with uncertain durations. EUSFLAT Conf. 2003: 586-591 |
| 2002 | ||
| j5 | | Stefan Chanas, Pawel Zielinski: The computational complexity of the criticality problems in a network with interval activity times. European Journal of Operational Research 136(3): 541-550 (2002) |
| j4 | | 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 | ||
| j3 | | Stefan Chanas, Pawel Zielinski: Critical path analysis in the network with fuzzy activity times. Fuzzy Sets and Systems 122(2): 195-204 (2001) |
| c1 | | Stefan Chanas, Didier Dubois, Pawel Zielinski: Criticality analysis in activity networks under incomplete information. EUSFLAT Conf. 2001: 233-236 |
| 2000 | ||
| j2 | | Stefan Chanas, Pawel Zielinski: On the equivalence of two optimization methods for fuzzy linear programming problems. European Journal of Operational Research 121(1): 56-63 (2000) |
| 1999 | ||
| j1 | | Stefan Chanas, Pawel Zielinski: Ranking Fuzzy Interval Numbers in the Setting of Random Sets - Further Results. Inf. Sci. 117(3-4): 191-200 (1999) |
Colors in the list of coauthors
Last update Sat May 25 08:06:08 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page