Adam Kasperski
Orcid: 0000-0003-1956-1812
According to our database1,
Adam Kasperski
authored at least 93 papers
between 2001 and 2025.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on id.loc.gov
On csauthors.net:
Bibliography
2025
Recoverable Robust Shortest Path Problem Under Interval Budgeted Uncertainty Representations.
Networks, January, 2025
Eur. J. Oper. Res., 2025
2024
Fuzzy Optim. Decis. Mak., June, 2024
Computational complexity of the recoverable robust shortest path problem in acyclic digraphs.
CoRR, 2024
Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse.
CoRR, 2024
CoRR, 2024
Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2024
Proceedings of the IEEE International Conference on Fuzzy Systems, 2024
2023
Fuzzy Sets Syst., February, 2023
2022
Solving Robust Production Planning Problem with Interval Budgeted Uncertainty in Cumulative Demands.
Vietnam. J. Comput. Sci., 2022
Optim. Lett., 2022
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty.
J. Comb. Optim., 2022
2021
Ann. Oper. Res., 2021
Proceedings of the Operations Research Proceedings 2021, Selected Papers of the International Conference of the Swiss, German and Austrian Operations Research Societies (SVOR/ASRO, GOR e.V., ÖGOR), University of Bern, Switzerland, August 31, 2021
Proceedings of the 30th IEEE International Conference on Fuzzy Systems, 2021
Proceedings of the 30th IEEE International Conference on Fuzzy Systems, 2021
Proceedings of the 30th IEEE International Conference on Fuzzy Systems, 2021
2020
Approximating combinatorial optimization problems with the ordered weighted averaging criterion.
Eur. J. Oper. Res., 2020
Softening the Robustness of Optimization Problems: A New Budgeted Uncertainty Approach.
Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems, 2020
Proceedings of the 29th IEEE International Conference on Fuzzy Systems, 2020
2019
Eur. J. Oper. Res., 2019
CoRR, 2019
Proceedings of the Operations Research Proceedings 2019, 2019
Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty.
Proceedings of the Operations Research Proceedings 2019, 2019
Proceedings of the 2019 IEEE International Conference on Fuzzy Systems, 2019
2018
Eur. J. Oper. Res., 2018
Approximating multiobjective combinatorial optimization problems with the OWA criterion.
CoRR, 2018
2017
The recoverable robust spanning tree problem with interval costs is polynomially solvable.
Optim. Lett., 2017
J. Comb. Optim., 2017
Proceedings of the Operations Research Proceedings 2017, 2017
2016
J. Sched., 2016
Int. J. Approx. Reason., 2016
The robust recoverable spanning tree problem with interval costs is polynomially solvable.
CoRR, 2016
A robust approach to a class of uncertain optimization problems with imprecise probabilities.
Proceedings of the 2016 IEEE International Conference on Fuzzy Systems, 2016
2015
Theor. Comput. Sci., 2015
Oper. Res. Lett., 2015
Optim. Lett., 2015
Proceedings of the Operations Research Proceedings 2015, 2015
2014
Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion.
Proceedings of the Operations Research Proceedings 2014, 2014
Proceedings of the Operations Research Proceedings 2014, 2014
2013
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion.
Oper. Res. Lett., 2013
Inf. Process. Lett., 2013
Proceedings of the Operations Research Proceedings 2013, 2013
2012
A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data.
J. Heuristics, 2012
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty.
Eur. J. Oper. Res., 2012
Approximating Combinatorial Optimization Problems with Uncertain Costs and the OWA Criterion.
Proceedings of the Operations Research Proceedings 2012, 2012
Proceedings of the Operations Research Proceedings 2012, 2012
Proceedings of the Advances in Computational Intelligence, 2012
2011
IEEE Trans. Fuzzy Syst., 2011
Int. J. Approx. Reason., 2011
Proceedings of the Nonlinear Mathematics for Uncertainty and its Applications, 2011
Proceedings of the FUZZ-IEEE 2011, 2011
2010
Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems.
Proceedings of the Fuzzy Optimization - Recent Advances and Applications, 2010
Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights.
Eur. J. Oper. Res., 2010
2009
Inf. Process. Lett., 2009
Fuzzy Sets Syst., 2009
Some methods for evaluating the optimality of elements in matroids with ill-known weights.
Fuzzy Sets Syst., 2009
A randomized algorithm for the min-max selecting items problem with uncertain weights.
Ann. Oper. Res., 2009
Proceedings of the Joint 2009 International Fuzzy Systems Association World Congress and 2009 European Society of Fuzzy Logic and Technology Conference, 2009
A Possibilistic Approach to Bottleneck Combinatorial Optimization Problems with Ill-Known Weights.
Proceedings of the Joint 2009 International Fuzzy Systems Association World Congress and 2009 European Society of Fuzzy Logic and Technology Conference, 2009
2008
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion.
Oper. Res. Lett., 2008
Proceedings of the FUZZ-IEEE 2008, 2008
Proceedings of the FUZZ-IEEE 2008, 2008
Studies in Fuzziness and Soft Computing 228, Springer, ISBN: 978-3-540-78483-8, 2008
2007
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data.
Oper. Res. Lett., 2007
Int. J. Uncertain. Fuzziness Knowl. Based Syst., 2007
Eur. J. Oper. Res., 2007
Proceedings of the Foundations of Fuzzy Logic and Soft Computing, 2007
Determining Unfuzzy Nondominated Solutions in Combinatorial Optimization Problems with Fuzzy Costs.
Proceedings of the FUZZ-IEEE 2007, 2007
2006
The robust shortest path problem in series-parallel multidigraphs with interval data.
Oper. Res. Lett., 2006
An approximation algorithm for interval data minmax regret combinatorial optimization problems.
Inf. Process. Lett., 2006
2005
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion.
Oper. Res. Lett., 2005
Sensitivity analysis in the single-machine scheduling problem with max-min criterion.
Int. Trans. Oper. Res., 2005
Fuzzy Sets Syst., 2005
A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids.
Proceedings of the Fuzzy Logic and Applications, 6th International Workshop, 2005
Efficient Methods for Computing Optimality Degrees of Elements in Fuzzy Weighted Matroids.
Proceedings of the Fuzzy Logic and Applications, 6th International Workshop, 2005
2004
Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters.
Fuzzy Sets Syst., 2004
2003
On two single machine scheduling problems with fuzzy processing times and fuzzy due dates.
Eur. J. Oper. Res., 2003
Proceedings of the 3rd Conference of the European Society for Fuzzy Logic and Technology, 2003
2001
Possible optimality of solutions in a single machine scheduling problem with fuzzy parameters.
Proceedings of the 2nd International Conference in Fuzzy Logic and Technology, 2001