Adam Kasperski

114 papers B 10Journal 79Unranked 23
YearRankTypeTitle / Venue / Authors
2025 J jnl
Approximating the shortest path problem with scenarios.
Theor. Comput. Sci.
Adam Kasperski, Pawel Zielinski
2025 J jnl
Computational complexity of the recoverable robust shortest path problem with discrete recourse.
Discret. Appl. Math.
Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski
2025 J jnl
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations.
Networks
Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski
2025 J jnl
Robust min-max (regret) optimization using ordered weighted averaging.
Eur. J. Oper. Res.
Werner Baak, Marc Goerigk, Adam Kasperski, Pawel Zielinski
2024 J jnl
A framework of distributionally robust possibilistic optimization.
Fuzzy Optim. Decis. Mak.
Romain Guillaume, Adam Kasperski, Pawel Zielinski
2024 J jnl
Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse.
CoRR
Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski
2024 J jnl
Computational complexity of the recoverable robust shortest path problem in acyclic digraphs.
CoRR
Adam Kasperski, Pawel Zielinski
2024 — conf
Lot Sizing Problem Under Lead-Time Uncertainty.
IPMU (1)
Romain Guillaume, Adam Kasperski, Pawel Zielinski
2024 — conf
Recoverable Possibilistic Linear Programming.
FUZZ
Adam Kasperski, Pawel Zielinski
2024 J jnl
Recoverable robust shortest path problem under interval uncertainty representations.
CoRR
Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski
2024 — conf
Using the R* Criterion to Selected Optimization Problems Under Uncertainty.
OR
Romain Guillaume, Adam Kasperski, Szymon Wróbel, Pawel Zielinski
2023 J jnl
Distributionally robust possibilistic optimization problems.
Fuzzy Sets Syst.
Romain Guillaume, Adam Kasperski, Pawel Zielinski
2023 J jnl
Robust optimization with belief functions.
CoRR
Marc Goerigk, Romain Guillaume, Adam Kasperski, Pawel Zielinski
2023 J jnl
Robust optimization with belief functions.
Int. J. Approx. Reason.
Marc Goerigk, Romain Guillaume, Adam Kasperski, Pawel Zielinski
2023 J jnl
Solving the recoverable robust shortest path problem in DAGs.
CoRR
Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski
2022 J jnl
A framework of distributionally robust possibilistic optimization.
CoRR
Romain Guillaume, Adam Kasperski, Pawel Zielinski
2022 J jnl
Robust inventory problem with budgeted cumulative demand uncertainty.
Optim. Lett.
Romain Guillaume, Adam Kasperski, Pawel Zielinski
2022 J jnl
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty.
J. Comb. Optim.
Marc Goerigk, Adam Kasperski, Pawel Zielinski
2022 J jnl
Solving Robust Production Planning Problem with Interval Budgeted Uncertainty in Cumulative Demands.
Vietnam. J. Comput. Sci.
Adam Kasperski, Pawel Zielinski
2021 J jnl
Combinatorial two-stage minmax regret problems under interval uncertainty.
Ann. Oper. Res.
Marc Goerigk, Adam Kasperski, Pawel Zielinski
2021 B conf
Distributionally Robust Optimization in Possibilistic Setting.
FUZZ-IEEE
Romain Guillaume, Adam Kasperski, Pawel Zielinski
2021 J jnl
Distributionally robust possibilistic optimization problems.
CoRR
Romain Guillaume, Adam Kasperski, Pawel Zielinski
2021 — conf
Robust Optimization with Scenarios Using Belief Functions.
OR
Romain Guillaume, Adam Kasperski, Pawel Zielinski
2021 B conf
Robust Possibilistic Optimization with Copula Function.
FUZZ-IEEE
Romain Guillaume, Adam Kasperski, Pawel Zielinski
2021 B conf
Robust optimization with scenarios using random fuzzy sets.
FUZZ-IEEE
Romain Guillaume, Adam Kasperski, Pawel Zielinski
2021 J jnl
Soft robust solutions to possibilistic optimization problems.
Fuzzy Sets Syst.
Adam Kasperski, Pawel Zielinski
2020 J jnl
Approximating combinatorial optimization problems with the ordered weighted averaging criterion.
Eur. J. Oper. Res.
André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
2020 J jnl
Combinatorial two-stage minmax regret problems under interval uncertainty.
CoRR
Marc Goerigk, Adam Kasperski, Pawel Zielinski
2020 B conf
Robust Possibilistic Production Planning Under Budgeted Demand Uncertainty.
FUZZ-IEEE
Romain Guillaume, Adam Kasperski, Pawel Zielinski
2020 J jnl
Robust production planning with budgeted cumulative demand uncertainty.
CoRR
Romain Guillaume, Adam Kasperski, Pawel Zielinski
2020 — conf
Softening the Robustness of Optimization Problems: A New Budgeted Uncertainty Approach.
IPMU (1)
Romain Guillaume, Adam Kasperski, Pawel Zielinski
2020 J jnl
Two-stage combinatorial optimization problems under risk.
Theor. Comput. Sci.
Marc Goerigk, Adam Kasperski, Pawel Zielinski
2019 B conf
A (Soft) Robustness for Possibilistic Optimization Problems.
FUZZ-IEEE
Adam Kasperski, Pawel Zielinski
2019 — conf
Production Planning Under Demand Uncertainty: A Budgeted Uncertainty Approach.
OR
Romain Guillaume, Adam Kasperski, Pawel Zielinski
2019 J jnl
Risk-averse single machine scheduling: complexity and approximation.
J. Sched.
Adam Kasperski, Pawel Zielinski
2019 J jnl
Robust recoverable 0-1 optimization problems under polyhedral uncertainty.
Eur. J. Oper. Res.
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
2019 J jnl
Robust two-stage combinatorial optimization problems under convex uncertainty.
CoRR
Marc Goerigk, Adam Kasperski, Pawel Zielinski
2019 J jnl
Soft robust solutions to possibilistic optimization problems.
CoRR
Adam Kasperski, Pawel Zielinski
2019 — conf
Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty.
OR
Marc Goerigk, Adam Kasperski, Pawel Zielinski
2018 J jnl
Approximating multiobjective combinatorial optimization problems with the OWA criterion.
CoRR
André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
2018 J jnl
Approximating some network problems with scenarios.
CoRR
Adam Kasperski, Pawel Zielinski
2018 J jnl
On recoverable and two-stage robust selection problems with budgeted uncertainty.
Eur. J. Oper. Res.
André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
2018 J jnl
Robust recoverable 0-1 optimization problems under polyhedral uncertainty.
CoRR
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
2018 J jnl
Two-stage Combinatorial Optimization Problems under Risk.
CoRR
Marc Goerigk, Adam Kasperski, Pawel Zielinski
2017 J jnl
On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty.
CoRR
André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski
2017 J jnl
Recoverable robust spanning tree problem under interval uncertainty representations.
J. Comb. Optim.
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
2017 — conf
Risk Averse Scheduling with Scenarios.
OR
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
2017 J jnl
Risk averse single machine scheduling - complexity and approximation.
CoRR
Adam Kasperski, Pawel Zielinski
2017 J jnl
Robust recoverable and two-stage selection problems.
Discret. Appl. Math.
Adam Kasperski, Pawel Zielinski
2017 J jnl
The recoverable robust spanning tree problem with interval costs is polynomially solvable.
Optim. Lett.
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
2016 B conf
A robust approach to a class of uncertain optimization problems with imprecise probabilities.
FUZZ-IEEE
Adam Kasperski, Pawel Zielinski
2016 J jnl
Recoverable robust spanning tree problem under interval uncertainty representations.
CoRR
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
2016 J jnl
Single machine scheduling problems with uncertain parameters and the OWA criterion.
J. Sched.
Adam Kasperski, Pawel Zielinski
2016 J jnl
The robust recoverable spanning tree problem with interval costs is polynomially solvable.
CoRR
Mikita Hradovich, Adam Kasperski, Pawel Zielinski
2016 J jnl
Using the WOWA operator in robust discrete optimization problems.
Int. J. Approx. Reason.
Adam Kasperski, Pawel Zielinski
2015 J jnl
Approximability of the robust representatives selection problem.
Oper. Res. Lett.
Adam Kasperski, Adam Kurpisz, Pawel Zielinski
2015 J jnl
Combinatorial optimization problems with uncertain costs and the OWA criterion.
Theor. Comput. Sci.
Adam Kasperski, Pawel Zielinski
2015 J jnl
Complexity of the robust weighted independent set problems on interval graphs.
Optim. Lett.
Adam Kasperski, Pawel Zielinski
2015 — conf
Robust Two-Stage Network Problems.
OR
Adam Kasperski, Pawel Zielinski
2015 J jnl
Robust recoverable and two-stage selection problems.
CoRR
Adam Kasperski, Pawel Zielinski
2015 J jnl
Using the WOWA operator in robust discrete optimization problems.
CoRR
Adam Kasperski, Pawel Zielinski
2014 J jnl
Approximability of the robust representatives selection problem.
CoRR
Adam Kasperski, Adam Kurpisz, Pawel Zielinski
2014 J jnl
Complexity of the robust weighted independent set problems on interval graphs.
CoRR
Adam Kasperski, Pawel Zielinski
2014 — conf
Robust Discrete Optimization Problems with the WOWA Criterion.
OR
Adam Kasperski, Pawel Zielinski
2014 — conf
Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion.
OR
Adam Kasperski, Pawel Zielinski
2014 J jnl
Single machine scheduling problems with uncertain parameters and the OWA criterion.
CoRR
Adam Kasperski, Pawel Zielinski
2013 J jnl
Approximating the min-max (regret) selecting items problem.
Inf. Process. Lett.
Adam Kasperski, Adam Kurpisz, Pawel Zielinski
2013 J jnl
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion.
CoRR
Adam Kasperski, Pawel Zielinski
2013 J jnl
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion.
Oper. Res. Lett.
Adam Kasperski, Pawel Zielinski
2013 J jnl
Combinatorial optimization problems with uncertain costs and the OWA criterion
CoRR
Adam Kasperski, Pawel Zielinski
2013 — conf
Sequencing Problems with Uncertain Parameters and the OWA Criterion.
OR
Adam Kasperski, Pawel Zielinski
2012 J jnl
A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data.
J. Heuristics
Adam Kasperski, Mariusz Makuchowski, Pawel Zielinski
2012 — conf
Approximating Combinatorial Optimization Problems with Uncertain Costs and the OWA Criterion.
OR
Adam Kasperski, Pawel Zielinski
2012 J jnl
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty.
Eur. J. Oper. Res.
Adam Kasperski, Adam Kurpisz, Pawel Zielinski
2012 — conf
Parallel Machine Scheduling under Uncertainty.
IPMU (4)
Adam Kasperski, Adam Kurpisz, Pawel Zielinski
2012 — conf
Recoverable Robust Combinatorial Optimization Problems.
OR
Adam Kasperski, Adam Kurpisz, Pawel Zielinski
2011 — conf
Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios.
NL-MUA
Adam Kasperski, Pawel Zielinski
2011 B conf
Min-max and two-stage possibilistic combinatorial optimization problems.
FUZZ-IEEE
Adam Kasperski, Pawel Zielinski
2011 J jnl
On the approximability of robust spanning tree problems.
Theor. Comput. Sci.
Adam Kasperski, Pawel Zielinski
2011 J jnl
Possibilistic Minmax Regret Sequencing Problems With Fuzzy Parameters.
IEEE Trans. Fuzzy Syst.
Adam Kasperski, Pawel Zielinski
2011 J jnl
Possibilistic bottleneck combinatorial optimization problems with ill-known weights.
Int. J. Approx. Reason.
Adam Kasperski, Pawel Zielinski
2010 — ch.
Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems.
Fuzzy Optimization
Adam Kasperski, Pawel Zielinski
2010 J jnl
Computing mean absolute deviation under uncertainty.
Appl. Soft Comput.
Barbara Gladysz, Adam Kasperski
2010 J jnl
Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights.
Eur. J. Oper. Res.
Adam Kasperski, Pawel Zielinski
2010 J jnl
On the approximability of robust spanning tree problems
CoRR
Adam Kasperski, Pawel Zielinski
2009 — conf
A Possibilistic Approach to Bottleneck Combinatorial Optimization Problems with Ill-Known Weights.
IFSA/EUSFLAT Conf.
Adam Kasperski, Pawel Zielinski
2009 J jnl
A randomized algorithm for the min-max selecting items problem with uncertain weights.
Ann. Oper. Res.
Adam Kasperski, Pawel Zielinski
2009 J jnl
Choosing robust solutions in discrete optimization problems with fuzzy costs.
Fuzzy Sets Syst.
Adam Kasperski, Michal Kulej
2009 — conf
On Possibilistic Sequencing Problems with Fuzzy Parameters.
IFSA/EUSFLAT Conf.
Adam Kasperski, Pawel Zielinski
2009 J jnl
On the approximability of minmax (regret) network optimization problems.
Inf. Process. Lett.
Adam Kasperski, Pawel Zielinski
2009 J jnl
Some methods for evaluating the optimality of elements in matroids with ill-known weights.
Fuzzy Sets Syst.
Jérôme Fortin, Adam Kasperski, Pawel Zielinski
2008 J jnl
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion.
Oper. Res. Lett.
Adam Kasperski, Pawel Zielinski
2008 — book
Discrete Optimization with Interval Data - Minmax Regret and Fuzzy Approach
Adam Kasperski
2008 B conf
On possibilistic combinatorial optimization problems.
FUZZ-IEEE
Adam Kasperski, Pawel Zielinski
2008 J jnl
On the approximability of minmax (regret) network optimization problems
CoRR
Adam Kasperski, Pawel Zielinski
2008 B conf
Solving combinatorial optimization problems with fuzzy weights.
FUZZ-IEEE
Adam Kasperski, Pawel Zielinski
2008 J jnl
The minimum spanning tree problem with fuzzy costs.
Fuzzy Optim. Decis. Mak.
Adam Janiak, Adam Kasperski
2007 B conf
Determining Unfuzzy Nondominated Solutions in Combinatorial Optimization Problems with Fuzzy Costs.
FUZZ-IEEE
Adam Kasperski, Pawel Zielinski
2007 J jnl
On combinatorial optimization problems on matroids with uncertain weights.
Eur. J. Oper. Res.
Adam Kasperski, Pawel Zielinski
2007 J jnl
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data.
Oper. Res. Lett.
Adam Kasperski, Pawel Zielinski
2007 J jnl
Some General Properties of a Fuzzy Single Machine Scheduling Problem.
Int. J. Uncertain. Fuzziness Knowl. Based Syst.
Adam Kasperski
2007 J jnl
The 0-1 knapsack problem with fuzzy data.
Fuzzy Optim. Decis. Mak.
Adam Kasperski, Michal Kulej
2007 — conf
Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems.
IFSA (1)
Adam Kasperski, Pawel Zielinski
2006 J jnl
An approximation algorithm for interval data minmax regret combinatorial optimization problems.
Inf. Process. Lett.
Adam Kasperski, Pawel Zielinski
2006 J jnl
The robust shortest path problem in series-parallel multidigraphs with interval data.
Oper. Res. Lett.
Adam Kasperski, Pawel Zielinski
2005 — conf
A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids.
WILF
Adam Kasperski, Pawel Zielinski
2005 J jnl
A possibilistic approach to sequencing problems with fuzzy parameters.
Fuzzy Sets Syst.
Adam Kasperski
2005 — conf
Efficient Methods for Computing Optimality Degrees of Elements in Fuzzy Weighted Matroids.
WILF
Jérôme Fortin, Adam Kasperski, Pawel Zielinski
2005 J jnl
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion.
Oper. Res. Lett.
Adam Kasperski
2005 J jnl
Sensitivity analysis in the single-machine scheduling problem with max-min criterion.
Int. Trans. Oper. Res.
Stefan Chanas, Adam Kasperski
2004 J jnl
Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters.
Fuzzy Sets Syst.
Stefan Chanas, Adam Kasperski
2003 J jnl
On two single machine scheduling problems with fuzzy processing times and fuzzy due dates.
Eur. J. Oper. Res.
Stefan Chanas, Adam Kasperski
2003 — conf
The fuzzy single machine scheduling problem - some general properties.
EUSFLAT Conf.
Adam Kasperski
2001 — conf
Possible optimality of solutions in a single machine scheduling problem with fuzzy parameters.
EUSFLAT Conf.
Stefan Chanas, Adam Kasperski