Ranking Fuzzy Interval Numbers in the Setting of Random Sets - Further Results. - Stefan Chanas; Pawel Zielinski 001 (Inf. Sci., 1999)

On the equivalence of two optimization methods for fuzzy linear programming problems. - Stefan Chanas; Pawel Zielinski 001 (Eur. J. Oper. Res., 2000)

Criticality analysis in activity networks under incomplete information. - Stefan Chanas; Didier Dubois; Pawel Zielinski 001 (EUSFLAT Conf., 2001)

Critical path analysis in the network with fuzzy activity times. - Stefan Chanas; Pawel Zielinski 001 (Fuzzy Sets Syst., 2001)

The computational complexity of the criticality problems in a network with interval activity times. - Stefan Chanas; Pawel Zielinski 001 (Eur. J. Oper. Res., 2002)

On the sure criticality of tasks in activity networks with imprecise durations. - Stefan Chanas; Didier Dubois; Pawel Zielinski 001 (IEEE Trans. Syst. Man Cybern. Part B, 2002)

Latest starting times and floats of activities in network with uncertain durations. - Pawel Zielinski 001 (EUSFLAT Conf., 2003)

On the hardness of evaluating criticality of activities in a planar network with duration intervals. - Stefan Chanas; Pawel Zielinski 001 (Oper. Res. Lett., 2003)

The computational complexity of the relative robust shortest path problem with interval data. - Pawel Zielinski 001 (Eur. J. Oper. Res., 2004)

Interval Analysis in Scheduling. - Jérôme Fortin; Pawel Zielinski 001; Didier Dubois; Hélène Fargier (CP, 2005)

Minimizing a Makespan Under Uncertainty. - Jérôme Fortin; Pawel Zielinski 001; Didier Dubois; Hélène Fargier (IJCAI, 2005)

Efficient Methods for Computing Optimality Degrees of Elements in Fuzzy Weighted Matroids. - Jérôme Fortin; Adam Kasperski; Pawel Zielinski 001 (WILF, 2005)

A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids. - Adam Kasperski; Pawel Zielinski 001 (WILF, 2005)

On computing the latest starting times and floats of activities in a network with imprecise durations. - Pawel Zielinski 001 (Fuzzy Sets Syst., 2005)

Efficient computation of project characteristics in a series-parallel activity network with interval durations. - Pawel Zielinski 001 (Decision Theory and Multi-Agent Planning, 2006)

An approximation algorithm for interval data minmax regret combinatorial optimization problems. - Adam Kasperski; Pawel Zielinski 001 (Inf. Process. Lett., 2006)

The robust shortest path problem in series-parallel multidigraphs with interval data. - Adam Kasperski; Pawel Zielinski 001 (Oper. Res. Lett., 2006)

Random Subsets of the Interval and P2P Protocols. - Jacek Cichon; Marek Klonowski; Lukasz Krzywiecki; Bartlomiej Rózanski; Pawel Zielinski 001 (APPROX-RANDOM, 2007)

Determining Unfuzzy Nondominated Solutions in Combinatorial Optimization Problems with Fuzzy Costs. - Adam Kasperski; Pawel Zielinski 001 (FUZZ-IEEE, 2007)

Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems. - Adam Kasperski; Pawel Zielinski 001 (IFSA (1), 2007)

On combinatorial optimization problems on matroids with uncertain weights. - Adam Kasperski; Pawel Zielinski 001 (Eur. J. Oper. Res., 2007)

On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data. - Adam Kasperski; Pawel Zielinski 001 (Oper. Res. Lett., 2007)

Solving combinatorial optimization problems with fuzzy weights. - Adam Kasperski; Pawel Zielinski 001 (FUZZ-IEEE, 2008)

On possibilistic combinatorial optimization problems. - Adam Kasperski; Pawel Zielinski 001 (FUZZ-IEEE, 2008)

A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion. - Adam Kasperski; Pawel Zielinski 001 (Oper. Res. Lett., 2008)

A Possibilistic Approach to Bottleneck Combinatorial Optimization Problems with Ill-Known Weights. - Adam Kasperski; Pawel Zielinski 001 (IFSA/EUSFLAT Conf., 2009)

On Possibilistic Sequencing Problems with Fuzzy Parameters. - Adam Kasperski; Pawel Zielinski 001 (IFSA/EUSFLAT Conf., 2009)

A randomized algorithm for the min-max selecting items problem with uncertain weights. - Adam Kasperski; Pawel Zielinski 001 (Ann. Oper. Res., 2009)

Some methods for evaluating the optimality of elements in matroids with ill-known weights. - Jérôme Fortin; Adam Kasperski; Pawel Zielinski 001 (Fuzzy Sets Syst., 2009)

On the approximability of minmax (regret) network optimization problems. - Adam Kasperski; Pawel Zielinski 001 (Inf. Process. Lett., 2009)

Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights. - Adam Kasperski; Pawel Zielinski 001 (Eur. J. Oper. Res., 2010)

Criticality analysis of activity networks under interval uncertainty. - Jérôme Fortin; Pawel Zielinski 001; Didier Dubois; Hélène Fargier (J. Sched., 2010)

Interval PERT and Its Fuzzy Extension. - Didier Dubois; Jérôme Fortin; Pawel Zielinski 001 (Production Engineering and Management under Fuzziness, 2010)

Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems. - Adam Kasperski; Pawel Zielinski 001 (Fuzzy Optimization, 2010)

Production planning with uncertain demands. - Romain Guillaume; Przemyslaw Kobylanski; Pawel Zielinski 001 (FUZZ-IEEE, 2011)

Min-max and two-stage possibilistic combinatorial optimization problems. - Adam Kasperski; Pawel Zielinski 001 (FUZZ-IEEE, 2011)

Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios. - Adam Kasperski; Pawel Zielinski 001 (NL-MUA, 2011)

Possibilistic bottleneck combinatorial optimization problems with ill-known weights. - Adam Kasperski; Pawel Zielinski 001 (Int. J. Approx. Reason., 2011)

On the approximability of robust spanning tree problems. - Adam Kasperski; Pawel Zielinski 001 (Theor. Comput. Sci., 2011)

Possibilistic Minmax Regret Sequencing Problems With Fuzzy Parameters. - Adam Kasperski; Pawel Zielinski 001 (IEEE Trans. Fuzzy Syst., 2011)

Decision Making under Scenario Uncertainty in a Requirement Planning. - Romain Guillaume; Pawel Zielinski 001 (IPMU (4), 2012)

Parallel Machine Scheduling under Uncertainty. - Adam Kasperski; Adam Kurpisz; Pawel Zielinski 001 (IPMU (4), 2012)

Recoverable Robust Combinatorial Optimization Problems. - Adam Kasperski; Adam Kurpisz; Pawel Zielinski 001 (OR, 2012)

Approximating Combinatorial Optimization Problems with Uncertain Costs and the OWA Criterion. - Adam Kasperski; Pawel Zielinski 001 (OR, 2012)

Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. - Adam Kasperski; Adam Kurpisz; Pawel Zielinski 001 (Eur. J. Oper. Res., 2012)

A robust lot sizing problem with ill-known demands. - Romain Guillaume; Przemyslaw Kobylanski; Pawel Zielinski 001 (Fuzzy Sets Syst., 2012)

A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data. - Adam Kasperski; Mariusz Makuchowski; Pawel Zielinski 001 (J. Heuristics, 2012)

Robust production plan with periodic order quantity under uncertain cumulative demands. - Romain Guillaume; Caroline Thierry; Pawel Zielinski 001 (ICNSC, 2013)

Sequencing Problems with Uncertain Parameters and the OWA Criterion. - Adam Kasperski; Pawel Zielinski 001 (OR, 2013)

Approximating the min-max (regret) selecting items problem. - Adam Kasperski; Adam Kurpisz; Pawel Zielinski 001 (Inf. Process. Lett., 2013)

Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion. - Adam Kasperski; Pawel Zielinski 001 (Oper. Res. Lett., 2013)

Robust Discrete Optimization Problems with the WOWA Criterion. - Adam Kasperski; Pawel Zielinski 001 (OR, 2014)

Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion. - Adam Kasperski; Pawel Zielinski 001 (OR, 2014)

Robust Two-Stage Network Problems. - Adam Kasperski; Pawel Zielinski 001 (OR, 2015)

On iterative algorithms for the polar decomposition of a matrix and the matrix sign function. - Andrzej Kielbasinski; Pawel Zielinski 001; Krystyna Zietak (Appl. Math. Comput., 2015)

Complexity of the robust weighted independent set problems on interval graphs. - Adam Kasperski; Pawel Zielinski 001 (Optim. Lett., 2015)

Approximability of the robust representatives selection problem. - Adam Kasperski; Adam Kurpisz; Pawel Zielinski 001 (Oper. Res. Lett., 2015)

Combinatorial optimization problems with uncertain costs and the OWA criterion. - Adam Kasperski; Pawel Zielinski 001 (Theor. Comput. Sci., 2015)

A robust approach to a class of uncertain optimization problems with imprecise probabilities. - Adam Kasperski; Pawel Zielinski 001 (FUZZ-IEEE, 2016)

The robust recoverable spanning tree problem with interval costs is polynomially solvable. - Mikita Hradovich; Adam Kasperski; Pawel Zielinski 001 (CoRR, 2016)

Using the WOWA operator in robust discrete optimization problems. - Adam Kasperski; Pawel Zielinski 001 (Int. J. Approx. Reason., 2016)

Single machine scheduling problems with uncertain parameters and the OWA criterion. - Adam Kasperski; Pawel Zielinski 001 (J. Sched., 2016)

Risk Averse Scheduling with Scenarios. - Mikita Hradovich; Adam Kasperski; Pawel Zielinski 001 (OR, 2017)

Robust recoverable and two-stage selection problems. - Adam Kasperski; Pawel Zielinski 001 (Discret. Appl. Math., 2017)

Robust material requirement planning with cumulative demand under uncertainty. - Romain Guillaume; Caroline Thierry; Pawel Zielinski 001 (Int. J. Prod. Res., 2017)

Recoverable robust spanning tree problem under interval uncertainty representations. - Mikita Hradovich; Adam Kasperski; Pawel Zielinski 001 (J. Comb. Optim., 2017)

The recoverable robust spanning tree problem with interval costs is polynomially solvable. - Mikita Hradovich; Adam Kasperski; Pawel Zielinski 001 (Optim. Lett., 2017)

Approximating multiobjective combinatorial optimization problems with the OWA criterion. - André B. Chassein; Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (CoRR, 2018)

Approximating some network problems with scenarios. - Adam Kasperski; Pawel Zielinski 001 (CoRR, 2018)

On recoverable and two-stage robust selection problems with budgeted uncertainty. - André B. Chassein; Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (Eur. J. Oper. Res., 2018)

A (Soft) Robustness for Possibilistic Optimization Problems. - Adam Kasperski; Pawel Zielinski 001 (FUZZ-IEEE, 2019)

Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty. - Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (OR, 2019)

Production Planning Under Demand Uncertainty: A Budgeted Uncertainty Approach. - Romain Guillaume; Adam Kasperski; Pawel Zielinski 001 (OR, 2019)

Robust two-stage combinatorial optimization problems under convex uncertainty. - Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (CoRR, 2019)

Robust recoverable 0-1 optimization problems under polyhedral uncertainty. - Mikita Hradovich; Adam Kasperski; Pawel Zielinski 001 (Eur. J. Oper. Res., 2019)

Risk-averse single machine scheduling: complexity and approximation. - Adam Kasperski; Pawel Zielinski 001 (J. Sched., 2019)

Robust Possibilistic Production Planning Under Budgeted Demand Uncertainty. - Romain Guillaume; Adam Kasperski; Pawel Zielinski 001 (FUZZ-IEEE, 2020)

Softening the Robustness of Optimization Problems: A New Budgeted Uncertainty Approach. - Romain Guillaume; Adam Kasperski; Pawel Zielinski 001 (IPMU (1), 2020)

Robust production planning with budgeted cumulative demand uncertainty. - Romain Guillaume; Adam Kasperski; Pawel Zielinski 001 (CoRR, 2020)

Approximating combinatorial optimization problems with the ordered weighted averaging criterion. - André B. Chassein; Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (Eur. J. Oper. Res., 2020)

Two-stage combinatorial optimization problems under risk. - Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (Theor. Comput. Sci., 2020)

Distributionally Robust Optimization in Possibilistic Setting. - Romain Guillaume; Adam Kasperski; Pawel Zielinski 001 (FUZZ-IEEE, 2021)

Robust optimization with scenarios using random fuzzy sets. - Romain Guillaume; Adam Kasperski; Pawel Zielinski 001 (FUZZ-IEEE, 2021)

Robust Possibilistic Optimization with Copula Function. - Romain Guillaume; Adam Kasperski; Pawel Zielinski 001 (FUZZ-IEEE, 2021)

Robust Optimization with Scenarios Using Belief Functions. - Romain Guillaume; Adam Kasperski; Pawel Zielinski 001 (OR, 2021)

Combinatorial two-stage minmax regret problems under interval uncertainty. - Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (Ann. Oper. Res., 2021)

Soft robust solutions to possibilistic optimization problems. - Adam Kasperski; Pawel Zielinski 001 (Fuzzy Sets Syst., 2021)

A framework of distributionally robust possibilistic optimization. - Pawel Zielinski 001 (LFA, 2022)

Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty. - Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (J. Comb. Optim., 2022)

Robust inventory problem with budgeted cumulative demand uncertainty. - Romain Guillaume; Adam Kasperski; Pawel Zielinski 001 (Optim. Lett., 2022)

Solving Robust Production Planning Problem with Interval Budgeted Uncertainty in Cumulative Demands. - Adam Kasperski; Pawel Zielinski 001 (Vietnam. J. Comput. Sci., 2022)

Solving the recoverable robust shortest path problem in DAGs. - Marcel Jackiewicz; Adam Kasperski; Pawel Zielinski 001 (CoRR, 2023)

Distributionally robust possibilistic optimization problems. - Romain Guillaume; Adam Kasperski; Pawel Zielinski 001 (Fuzzy Sets Syst., 2023)

Robust optimization with belief functions. - Marc Goerigk; Romain Guillaume; Adam Kasperski; Pawel Zielinski 001 (Int. J. Approx. Reason., 2023)

Recoverable Possibilistic Linear Programming. - Adam Kasperski; Pawel Zielinski 001 (FUZZ, 2024)

Lot Sizing Problem Under Lead-Time Uncertainty. - Romain Guillaume; Adam Kasperski; Pawel Zielinski 001 (IPMU (1), 2024)

Recoverable robust shortest path problem under interval uncertainty representations. - Marcel Jackiewicz; Adam Kasperski; Pawel Zielinski 001 (CoRR, 2024)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs. - Adam Kasperski; Pawel Zielinski 001 (CoRR, 2024)

A framework of distributionally robust possibilistic optimization. - Romain Guillaume; Adam Kasperski; Pawel Zielinski 001 (Fuzzy Optim. Decis. Mak., 2024)

Computational complexity of the recoverable robust shortest path problem with discrete recourse. - Marcel Jackiewicz; Adam Kasperski; Pawel Zielinski 001 (Discret. Appl. Math., 2025)

Robust min-max (regret) optimization using ordered weighted averaging. - Werner Baak; Marc Goerigk; Adam Kasperski; Pawel Zielinski 001 (Eur. J. Oper. Res., 2025)

Approximating the shortest path problem with scenarios. - Adam Kasperski; Pawel Zielinski 001 (Theor. Comput. Sci., 2025)

Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations. - Marcel Jackiewicz; Adam Kasperski; Pawel Zielinski 001 (Networks, 2025)