Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Torgny Andersson
Robert J. Zomer
Evan W McConnell
Scott A. Starks
D. N. Prabhakar Murthy
Hikaru Fujisaki
Michael Terry
Zhihao Li
Vytautas Grigas
Radu Timofte
Home
/
Author
/
PAWEŁ ZIELIŃSKI
Author Info
Open Visualization
Name
Affiliation
Papers
PAWEŁ ZIELIŃSKI
Institute of Mathematics, Wrocław University of Technology, Wybrzeże Wyspiańskiego 27, 50-370 Wrocław, Poland
22
Collaborators
Citations
PageRank
18
274
19.73
Referers
Referees
References
321
240
250
Search Limit
100
321
Publications (22 rows)
Collaborators (18 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Robust inventory problem with budgeted cumulative demand uncertainty
0
0.34
2022
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
0
0.34
2022
Risk-averse single machine scheduling: complexity and approximation
1
0.35
2019
Approximating the min-max (regret) selecting items problem
14
0.92
2013
A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data
9
0.58
2012
A robust lot sizing problem with ill-known demands
4
0.39
2012
Possibilistic bottleneck combinatorial optimization problems with ill-known weights
0
0.34
2011
Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
12
0.59
2010
Criticality analysis of activity networks under interval uncertainty
9
0.72
2010
On the approximability of minmax (regret) network optimization problems
20
1.01
2009
Some methods for evaluating the optimality of elements in matroids with ill-known weights
2
0.42
2009
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
21
0.91
2008
Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems
10
0.65
2007
Random Subsets of the Interval and P2P Protocols
4
0.48
2007
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
11
0.65
2007
An approximation algorithm for interval data minmax regret combinatorial optimization problems
35
1.71
2006
The robust shortest path problem in series-parallel multidigraphs with interval data
21
0.96
2006
A possibilistic approach to combinatorial optimization problems on fuzzy-valued matroids
6
0.68
2005
Efficient methods for computing optimality degrees of elements in fuzzy weighted matroids
5
0.62
2005
On computing the latest starting times and floats of activities in a network with imprecise durations
16
1.05
2005
On the hardness of evaluating criticality of activities in a planar network with duration intervals
17
1.24
2003
Critical path analysis in the network with fuzzy activity times
57
4.79
2001
1