The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pawel Zielinski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jérôme Fortin, Pawel Zielinski, Didier Dubois, Hélène Fargier
    Interval Analysis in Scheduling. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:226-240 [Conf]
  2. Jérôme Fortin, Pawel Zielinski, Didier Dubois, Hélène Fargier
    Minimizing a Makespan Under Uncertainty. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:1519-1520 [Conf]
  3. Jérôme Fortin, Adam Kasperski, Pawel Zielinski
    Efficient Methods for Computing Optimality Degrees of Elements in Fuzzy Weighted Matroids. [Citation Graph (0, 0)][DBLP]
    WILF, 2005, pp:99-107 [Conf]
  4. Adam Kasperski, Pawel Zielinski
    A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids. [Citation Graph (0, 0)][DBLP]
    WILF, 2005, pp:46-52 [Conf]
  5. Stefan Chanas, Pawel Zielinski
    Critical path analysis in the network with fuzzy activity times. [Citation Graph (0, 0)][DBLP]
    Fuzzy Sets and Systems, 2001, v:122, n:2, pp:195-204 [Journal]
  6. Pawel Zielinski
    On computing the latest starting times and floats of activities in a network with imprecise durations. [Citation Graph (0, 0)][DBLP]
    Fuzzy Sets and Systems, 2005, v:150, n:1, pp:53-76 [Journal]
  7. Adam Kasperski, Pawel Zielinski
    An approximation algorithm for interval data minmax regret combinatorial optimization problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:97, n:5, pp:177-180 [Journal]
  8. Stefan Chanas, Pawel Zielinski
    Ranking Fuzzy Interval Numbers in the Setting of Random Sets - Further Results. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1999, v:117, n:3-4, pp:191-200 [Journal]
  9. Stefan Chanas, Pawel Zielinski
    On the hardness of evaluating criticality of activities in a planar network with duration intervals. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2003, v:31, n:1, pp:53-59 [Journal]
  10. Adam Kasperski, Pawel Zielinski
    The robust shortest path problem in series-parallel multidigraphs with interval data. [Citation Graph (0, 0)][DBLP]
    Oper. Res. Lett., 2006, v:34, n:1, pp:69-76 [Journal]
  11. Stefan Chanas, Didier Dubois, Pawel Zielinski
    On the sure criticality of tasks in activity networks with imprecise durations. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Systems, Man, and Cybernetics, Part B, 2002, v:32, n:4, pp:393-407 [Journal]
  12. Adam Kasperski, Pawel Zielinski
    On combinatorial optimization problems on matroids with uncertain weights. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2007, v:177, n:2, pp:851-864 [Journal]
  13. Pawel Zielinski
    The computational complexity of the relative robust shortest path problem with interval data. [Citation Graph (0, 0)][DBLP]
    European Journal of Operational Research, 2004, v:158, n:3, pp:570-576 [Journal]
  14. Jacek Cichon, Marek Klonowski, Lukasz Krzywiecki, Bartlomiej Rózanski, Pawel Zielinski
    Random Subsets of the Interval and P2P Protocols. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:409-421 [Conf]
  15. Adam Kasperski, Pawel Zielinski
    Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems. [Citation Graph (0, 0)][DBLP]
    IFSA, 2007, pp:656-665 [Conf]

  16. Determining Unfuzzy Nondominated Solutions in Combinatorial Optimization Problems with Fuzzy Costs. [Citation Graph (, )][DBLP]


  17. Latest starting times and floats of activities in network with uncertain durations. [Citation Graph (, )][DBLP]


  18. Criticality analysis in activity networks under incomplete information. [Citation Graph (, )][DBLP]


  19. On Possibilistic Sequencing Problems with Fuzzy Parameters. [Citation Graph (, )][DBLP]


  20. A Possibilistic Approach to Bottleneck Combinatorial Optimization Problems with Ill-Known Weights. [Citation Graph (, )][DBLP]


  21. On the approximability of minmax (regret) network optimization problems [Citation Graph (, )][DBLP]


  22. On the approximability of robust spanning tree problems [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002