Adam Kasperski

From MaRDI portal


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Recoverable robust shortest path problem under interval budgeted uncertainty representations
Networks
2025-01-15Paper
Approximating the shortest path problem with scenarios
Theoretical Computer Science
2024-12-12Paper
Robust optimization with scenarios using belief functions
 
2024-09-17Paper
A framework of distributionally robust possibilistic optimization
Fuzzy Optimization and Decision Making
2024-07-10Paper
Wasserstein robust combinatorial optimization problems
 
2023-12-20Paper
Distributionally robust possibilistic optimization problems
Fuzzy Sets and Systems
2023-10-31Paper
Soft robust solutions to possibilistic optimization problems
Fuzzy Sets and Systems
2023-10-26Paper
Robust optimization with belief functions
International Journal of Approximate Reasoning
2023-07-18Paper
Softening the Robustness of Optimization Problems: A New Budgeted Uncertainty Approach
1517.90093
2022-12-06Paper
Robust inventory problem with budgeted cumulative demand uncertainty
Optimization Letters
2022-11-01Paper
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty
Journal of Combinatorial Optimization
2022-04-13Paper
Combinatorial two-stage minmax regret problems under interval uncertainty
Annals of Operations Research
2021-11-08Paper
Solving robust two-stage combinatorial optimization problems under convex uncertainty
 
2021-08-30Paper
Production planning under demand uncertainty: a budgeted uncertainty approach
 
2021-08-30Paper
Approximating combinatorial optimization problems with the ordered weighted averaging criterion
European Journal of Operational Research
2020-06-17Paper
Risk-averse single machine scheduling: complexity and approximation
Journal of Scheduling
2020-01-22Paper
Two-stage combinatorial optimization problems under risk
Theoretical Computer Science
2019-12-27Paper
Robust recoverable 0-1 optimization problems under polyhedral uncertainty
European Journal of Operational Research
2019-06-25Paper
Risk averse scheduling with scenarios
Operations Research Proceedings
2018-10-09Paper
Approximability of the robust representatives selection problem
Operations Research Letters
2018-09-28Paper
Robust Two-Stage Network Problems
Operations Research Proceedings
2017-12-01Paper
On recoverable and two-stage robust selection problems with budgeted uncertainty
European Journal of Operational Research
2017-11-23Paper
Robust recoverable and two-stage selection problems
Discrete Applied Mathematics
2017-10-17Paper
Recoverable robust spanning tree problem under interval uncertainty representations
Journal of Combinatorial Optimization
2017-10-17Paper
The recoverable robust spanning tree problem with interval costs is polynomially solvable
Optimization Letters
2017-06-29Paper
Robust single machine scheduling problem with weighted number of late jobs criterion
Operations Research Proceedings
2016-05-19Paper
Robust discrete optimization problems with the WOWA criterion
Operations Research Proceedings
2016-05-19Paper
Single machine scheduling problems with uncertain parameters and the OWA criterion
Journal of Scheduling
2016-05-12Paper
Using the WOWA operator in robust discrete optimization problems
International Journal of Approximate Reasoning
2015-12-03Paper
A computational study of approximation algorithms for a minmax resource allocation problem
 
2015-07-16Paper
Complexity of the robust weighted independent set problems on interval graphs
Optimization Letters
2015-03-25Paper
Approximating combinatorial optimization problems with uncertain costs and the OWA criterion
Operations Research Proceedings
2015-02-12Paper
Recoverable Robust Combinatorial Optimization Problems
Operations Research Proceedings
2015-02-12Paper
Combinatorial optimization problems with uncertain costs and the OWA criterion
Theoretical Computer Science
2014-12-22Paper
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
Operations Research Letters
2014-05-15Paper
Bottleneck combinatorial optimization problems with fuzzy scenarios
Advances in Intelligent and Soft Computing
2013-07-10Paper
Approximating the min-max (regret) selecting items problem
Information Processing Letters
2013-03-21Paper
Parallel machine scheduling under uncertainty
Communications in Computer and Information Science
2012-12-03Paper
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
European Journal of Operational Research
2012-08-16Paper
Possibilistic bottleneck combinatorial optimization problems with ill-known weights
International Journal of Approximate Reasoning
2012-07-05Paper
On the approximability of robust spanning tree problems
Theoretical Computer Science
2011-02-02Paper
Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems
Fuzzy Optimization
2010-11-08Paper
On the approximability of minmax (regret) network optimization problems
Information Processing Letters
2010-06-16Paper
A randomized algorithm for the min-Max selecting items problem with uncertain weights
Annals of Operations Research
2010-03-01Paper
An approximation algorithm for interval data minmax regret combinatorial optimization problems
Information Processing Letters
2009-12-18Paper
Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
European Journal of Operational Research
2009-12-10Paper
Some methods for evaluating the optimality of elements in matroids with ill-known weights
Fuzzy Sets and Systems
2009-11-17Paper
Choosing robust solutions in discrete optimization problems with fuzzy costs
Fuzzy Sets and Systems
2009-11-17Paper
The minimum spanning tree problem with fuzzy costs
Fuzzy Optimization and Decision Making
2009-07-06Paper
A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids
Fuzzy Logic and Applications
2009-07-02Paper
Efficient Methods for Computing Optimality Degrees of Elements in Fuzzy Weighted Matroids
Fuzzy Logic and Applications
2009-07-02Paper
The 0-1 knapsack problem with fuzzy data
Fuzzy Optimization and Decision Making
2009-02-12Paper
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
Operations Research Letters
2008-09-10Paper
Discrete optimization with interval data. Minmax regret and fuzzy approach
Studies in Fuzziness and Soft Computing
2008-05-29Paper
Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems
Lecture Notes in Computer Science
2008-01-02Paper
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
Operations Research Letters
2007-10-30Paper
SOME GENERAL PROPERTIES OF A FUZZY SINGLE MACHINE SCHEDULING PROBLEM
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
2007-05-23Paper
On combinatorial optimization problems on matroids with uncertain weights
European Journal of Operational Research
2006-12-07Paper
The robust shortest path problem in series -- parallel multidigraphs with interval data
Operations Research Letters
2006-01-18Paper
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
Operations Research Letters
2005-08-25Paper
Sensitivity analysis in the single-machine scheduling problem with max-min criterion
International Transactions in Operational Research
2005-07-04Paper
scientific article; zbMATH DE number 2159168 (Why is no real title available?)
 
2005-04-19Paper
A possibilistic approach to sequencing problems with fuzzy parameters
Fuzzy Sets and Systems
2005-04-07Paper
Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters.
Fuzzy Sets and Systems
2004-03-15Paper
On two single machine scheduling problems with fuzzy processing times and fuzzy due dates
European Journal of Operational Research
2003-04-28Paper
scientific article; zbMATH DE number 1539054 (Why is no real title available?)
 
2000-12-03Paper
Robust Min-Max (Regret) Optimization using Ordered Weighted Averaging
 
N/APaper


Research outcomes over time


This page was built for person: Adam Kasperski