Adam Kasperski

ORCID

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 48

Top Venues

CoRR

FUZZ-IEEE

Optim. Lett.

Publications

Romain Guillaume, Adam Kasperski, Pawel Zielinski
A framework of distributionally robust possibilistic optimization. Fuzzy Optim. Decis. Mak. 23 (2) (2024)
Adam Kasperski, Pawel Zielinski
Recoverable Possibilistic Linear Programming. FUZZ (2024)
Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski
Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse. CoRR (2024)
Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski
Recoverable robust shortest path problem under interval uncertainty representations. CoRR (2024)
Marc Goerigk, Romain Guillaume, Adam Kasperski, Pawel Zielinski
Robust optimization with belief functions. Int. J. Approx. Reason. 159 (2023)
Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski
Solving the recoverable robust shortest path problem in DAGs. CoRR (2023)
Romain Guillaume, Adam Kasperski, Pawel Zielinski
Distributionally robust possibilistic optimization problems. Fuzzy Sets Syst. 454 (2023)
Marc Goerigk, Romain Guillaume, Adam Kasperski, Pawel Zielinski
Robust optimization with belief functions. CoRR (2023)
Romain Guillaume, Adam Kasperski, Pawel Zielinski
A framework of distributionally robust possibilistic optimization. CoRR (2022)
Marc Goerigk, Adam Kasperski, Pawel Zielinski
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty. J. Comb. Optim. 43 (3) (2022)
Adam Kasperski, Pawel Zielinski
Solving Robust Production Planning Problem with Interval Budgeted Uncertainty in Cumulative Demands. Vietnam. J. Comput. Sci. 9 (3) (2022)
Romain Guillaume, Adam Kasperski, Pawel Zielinski
Robust inventory problem with budgeted cumulative demand uncertainty. Optim. Lett. 16 (9) (2022)
Romain Guillaume, Adam Kasperski, Pawel Zielinski
Robust optimization with scenarios using random fuzzy sets. FUZZ-IEEE (2021)
Romain Guillaume, Adam Kasperski, Pawel Zielinski
Robust Possibilistic Optimization with Copula Function. FUZZ-IEEE (2021)
Romain Guillaume, Adam Kasperski, Pawel Zielinski
Distributionally Robust Optimization in Possibilistic Setting. FUZZ-IEEE (2021)
Romain Guillaume, Adam Kasperski, Pawel Zielinski
Distributionally robust possibilistic optimization problems. CoRR (2021)
Romain Guillaume, Adam Kasperski, Pawel Zielinski
Robust Optimization with Scenarios Using Belief Functions. OR (2021)
Adam Kasperski, Pawel Zielinski
Soft robust solutions to possibilistic optimization problems. Fuzzy Sets Syst. 422 (2021)
Marc Goerigk, Adam Kasperski, Pawel Zielinski
Combinatorial two-stage minmax regret problems under interval uncertainty. Ann. Oper. Res. 300 (1) (2021)
Romain Guillaume, Adam Kasperski, Pawel Zielinski
Robust Possibilistic Production Planning Under Budgeted Demand Uncertainty. FUZZ-IEEE (2020)
Marc Goerigk, Adam Kasperski, Pawel Zielinski
Combinatorial two-stage minmax regret problems under interval uncertainty. CoRR (2020)
Marc Goerigk, Adam Kasperski, Pawel Zielinski
Two-stage combinatorial optimization problems under risk. Theor. Comput. Sci. 804 (2020)
André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
Approximating combinatorial optimization problems with the ordered weighted averaging criterion. Eur. J. Oper. Res. 286 (3) (2020)
Romain Guillaume, Adam Kasperski, Pawel Zielinski
Robust production planning with budgeted cumulative demand uncertainty. CoRR (2020)
Romain Guillaume, Adam Kasperski, Pawel Zielinski
Softening the Robustness of Optimization Problems: A New Budgeted Uncertainty Approach. IPMU (1) (2020)
Marc Goerigk, Adam Kasperski, Pawel Zielinski
Robust two-stage combinatorial optimization problems under convex uncertainty. CoRR (2019)
Marc Goerigk, Adam Kasperski, Pawel Zielinski
Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty. OR (2019)
Adam Kasperski, Pawel Zielinski
Soft robust solutions to possibilistic optimization problems. CoRR (2019)
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
Robust recoverable 0-1 optimization problems under polyhedral uncertainty. Eur. J. Oper. Res. 278 (1) (2019)
Adam Kasperski, Pawel Zielinski
Risk-averse single machine scheduling: complexity and approximation. J. Sched. 22 (5) (2019)
Adam Kasperski, Pawel Zielinski
A (Soft) Robustness for Possibilistic Optimization Problems. FUZZ-IEEE (2019)
Romain Guillaume, Adam Kasperski, Pawel Zielinski
Production Planning Under Demand Uncertainty: A Budgeted Uncertainty Approach. OR (2019)
Marc Goerigk, Adam Kasperski, Pawel Zielinski
Two-stage Combinatorial Optimization Problems under Risk. CoRR (2018)
André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
Approximating multiobjective combinatorial optimization problems with the OWA criterion. CoRR (2018)
André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
On recoverable and two-stage robust selection problems with budgeted uncertainty. Eur. J. Oper. Res. 265 (2) (2018)
Adam Kasperski, Pawel Zielinski
Approximating some network problems with scenarios. CoRR (2018)
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
Robust recoverable 0-1 optimization problems under polyhedral uncertainty. CoRR (2018)
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
The recoverable robust spanning tree problem with interval costs is polynomially solvable. Optim. Lett. 11 (1) (2017)
Adam Kasperski, Pawel Zielinski
Risk averse single machine scheduling - complexity and approximation. CoRR (2017)
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
Recoverable robust spanning tree problem under interval uncertainty representations. J. Comb. Optim. 34 (2) (2017)
Adam Kasperski, Pawel Zielinski
Robust recoverable and two-stage selection problems. Discret. Appl. Math. 233 (2017)
André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty. CoRR (2017)
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
Risk Averse Scheduling with Scenarios. OR (2017)
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
Recoverable robust spanning tree problem under interval uncertainty representations. CoRR (2016)
Adam Kasperski, Pawel Zielinski
Single machine scheduling problems with uncertain parameters and the OWA criterion. J. Sched. 19 (2) (2016)
Adam Kasperski, Pawel Zielinski
A robust approach to a class of uncertain optimization problems with imprecise probabilities. FUZZ-IEEE (2016)
Adam Kasperski, Pawel Zielinski
Using the WOWA operator in robust discrete optimization problems. Int. J. Approx. Reason. 68 (2016)
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
The robust recoverable spanning tree problem with interval costs is polynomially solvable. CoRR (2016)
Adam Kasperski, Pawel Zielinski
Robust Two-Stage Network Problems. OR (2015)
Adam Kasperski, Pawel Zielinski
Complexity of the robust weighted independent set problems on interval graphs. Optim. Lett. 9 (3) (2015)
Adam Kasperski, Pawel Zielinski
Robust recoverable and two-stage selection problems. CoRR (2015)
Adam Kasperski, Pawel Zielinski
Using the WOWA operator in robust discrete optimization problems. CoRR (2015)
Adam Kasperski, Adam Kurpisz, Pawel Zielinski
Approximability of the robust representatives selection problem. Oper. Res. Lett. 43 (1) (2015)
Adam Kasperski, Pawel Zielinski
Combinatorial optimization problems with uncertain costs and the OWA criterion. Theor. Comput. Sci. 565 (2015)
Adam Kasperski, Pawel Zielinski
Robust Discrete Optimization Problems with the WOWA Criterion. OR (2014)
Adam Kasperski, Pawel Zielinski
Complexity of the robust weighted independent set problems on interval graphs. CoRR (2014)
Adam Kasperski, Pawel Zielinski
Single machine scheduling problems with uncertain parameters and the OWA criterion. CoRR (2014)
Adam Kasperski, Pawel Zielinski
Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion. OR (2014)
Adam Kasperski, Adam Kurpisz, Pawel Zielinski
Approximability of the robust representatives selection problem. CoRR (2014)
Adam Kasperski, Pawel Zielinski
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion. CoRR (2013)
Adam Kasperski, Pawel Zielinski
Sequencing Problems with Uncertain Parameters and the OWA Criterion. OR (2013)
Adam Kasperski, Pawel Zielinski
Combinatorial optimization problems with uncertain costs and the OWA criterion CoRR (2013)
Adam Kasperski, Adam Kurpisz, Pawel Zielinski
Approximating the min-max (regret) selecting items problem. Inf. Process. Lett. 113 (1-2) (2013)
Adam Kasperski, Pawel Zielinski
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion. Oper. Res. Lett. 41 (6) (2013)
Adam Kasperski, Adam Kurpisz, Pawel Zielinski
Recoverable Robust Combinatorial Optimization Problems. OR (2012)
Adam Kasperski, Adam Kurpisz, Pawel Zielinski
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. Eur. J. Oper. Res. 217 (1) (2012)
Adam Kasperski, Adam Kurpisz, Pawel Zielinski
Parallel Machine Scheduling under Uncertainty. IPMU (4) (2012)
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) (2012)
Adam Kasperski, Pawel Zielinski
Approximating Combinatorial Optimization Problems with Uncertain Costs and the OWA Criterion. OR (2012)
Adam Kasperski, Pawel Zielinski
Possibilistic bottleneck combinatorial optimization problems with ill-known weights. Int. J. Approx. Reason. 52 (9) (2011)
Adam Kasperski, Pawel Zielinski
Min-max and two-stage possibilistic combinatorial optimization problems. FUZZ-IEEE (2011)
Adam Kasperski, Pawel Zielinski
Possibilistic Minmax Regret Sequencing Problems With Fuzzy Parameters. IEEE Trans. Fuzzy Syst. 19 (6) (2011)
Adam Kasperski, Pawel Zielinski
On the approximability of robust spanning tree problems. Theor. Comput. Sci. 412 (4-5) (2011)
Adam Kasperski, Pawel Zielinski
Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios. NL-MUA (2011)
Barbara Gladysz, Adam Kasperski
Computing mean absolute deviation under uncertainty. Appl. Soft Comput. 10 (2) (2010)
Adam Kasperski, Pawel Zielinski
Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights. Eur. J. Oper. Res. 200 (3) (2010)
Adam Kasperski, Pawel Zielinski
On the approximability of robust spanning tree problems CoRR (2010)
Adam Kasperski, Pawel Zielinski
On the approximability of minmax (regret) network optimization problems. Inf. Process. Lett. 109 (5) (2009)
Adam Kasperski, Pawel Zielinski
A randomized algorithm for the min-max selecting items problem with uncertain weights. Ann. Oper. Res. 172 (1) (2009)
Adam Kasperski, Pawel Zielinski
On Possibilistic Sequencing Problems with Fuzzy Parameters. IFSA/EUSFLAT Conf. (2009)
Adam Kasperski, Pawel Zielinski
A Possibilistic Approach to Bottleneck Combinatorial Optimization Problems with Ill-Known Weights. IFSA/EUSFLAT Conf. (2009)
Jérôme Fortin, Adam Kasperski, Pawel Zielinski
Some methods for evaluating the optimality of elements in matroids with ill-known weights. Fuzzy Sets Syst. 160 (10) (2009)
Adam Kasperski, Michal Kulej
Choosing robust solutions in discrete optimization problems with fuzzy costs. Fuzzy Sets Syst. 160 (5) (2009)
Adam Janiak, Adam Kasperski
The minimum spanning tree problem with fuzzy costs. Fuzzy Optim. Decis. Mak. 7 (2) (2008)
Adam Kasperski, Pawel Zielinski
On possibilistic combinatorial optimization problems. FUZZ-IEEE (2008)
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) (2008)
Adam Kasperski, Pawel Zielinski
Solving combinatorial optimization problems with fuzzy weights. FUZZ-IEEE (2008)
Adam Kasperski, Pawel Zielinski
On the approximability of minmax (regret) network optimization problems CoRR (2008)
Adam Kasperski, Pawel Zielinski
Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems. IFSA (1) (2007)
Adam Kasperski
Some General Properties of a Fuzzy Single Machine Scheduling Problem. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 15 (1) (2007)
Adam Kasperski, Pawel Zielinski
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data. Oper. Res. Lett. 35 (4) (2007)
Adam Kasperski, Pawel Zielinski
On combinatorial optimization problems on matroids with uncertain weights. Eur. J. Oper. Res. 177 (2) (2007)
Adam Kasperski, Pawel Zielinski
Determining Unfuzzy Nondominated Solutions in Combinatorial Optimization Problems with Fuzzy Costs. FUZZ-IEEE (2007)
Adam Kasperski, Michal Kulej
The 0-1 knapsack problem with fuzzy data. Fuzzy Optim. Decis. Mak. 6 (2) (2007)
Adam Kasperski, Pawel Zielinski
The robust shortest path problem in series-parallel multidigraphs with interval data. Oper. Res. Lett. 34 (1) (2006)
Adam Kasperski, Pawel Zielinski
An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inf. Process. Lett. 97 (5) (2006)
Adam Kasperski
A possibilistic approach to sequencing problems with fuzzy parameters. Fuzzy Sets Syst. 150 (1) (2005)
Adam Kasperski
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion. Oper. Res. Lett. 33 (4) (2005)
Stefan Chanas, Adam Kasperski
Sensitivity analysis in the single-machine scheduling problem with max-min criterion. Int. Trans. Oper. Res. 12 (3) (2005)
Adam Kasperski, Pawel Zielinski
A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids. WILF (2005)

Adam Kasperski.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Adam Kasperski