Adam Kasperski

From MaRDI portal
Person:282248

Available identifiers

zbMath Open kasperski.adamMaRDI QIDQ282248

List of research outcomes





PublicationDate of PublicationType
Recoverable robust shortest path problem under interval budgeted uncertainty representations2025-01-15Paper
Approximating the shortest path problem with scenarios2024-12-12Paper
Robust optimization with scenarios using belief functions2024-09-17Paper
A framework of distributionally robust possibilistic optimization2024-07-10Paper
Wasserstein robust combinatorial optimization problems2023-12-20Paper
Distributionally robust possibilistic optimization problems2023-10-31Paper
Soft robust solutions to possibilistic optimization problems2023-10-26Paper
Robust optimization with belief functions2023-07-18Paper
Softening the Robustness of Optimization Problems: A New Budgeted Uncertainty Approach2022-12-06Paper
Robust inventory problem with budgeted cumulative demand uncertainty2022-11-01Paper
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty2022-04-13Paper
Combinatorial two-stage minmax regret problems under interval uncertainty2021-11-08Paper
Solving robust two-stage combinatorial optimization problems under convex uncertainty2021-08-30Paper
Production planning under demand uncertainty: a budgeted uncertainty approach2021-08-30Paper
Approximating combinatorial optimization problems with the ordered weighted averaging criterion2020-06-17Paper
Risk-averse single machine scheduling: complexity and approximation2020-01-22Paper
Two-stage combinatorial optimization problems under risk2019-12-27Paper
Robust recoverable 0-1 optimization problems under polyhedral uncertainty2019-06-25Paper
Risk Averse Scheduling with Scenarios2018-10-09Paper
Approximability of the robust representatives selection problem2018-09-28Paper
Robust Two-Stage Network Problems2017-12-01Paper
On recoverable and two-stage robust selection problems with budgeted uncertainty2017-11-23Paper
Robust recoverable and two-stage selection problems2017-10-17Paper
Recoverable robust spanning tree problem under interval uncertainty representations2017-10-17Paper
The recoverable robust spanning tree problem with interval costs is polynomially solvable2017-06-29Paper
Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion2016-05-19Paper
Robust Discrete Optimization Problems with the WOWA Criterion2016-05-19Paper
Single machine scheduling problems with uncertain parameters and the OWA criterion2016-05-12Paper
Using the WOWA operator in robust discrete optimization problems2015-12-03Paper
https://portal.mardi4nfdi.de/entity/Q52628582015-07-16Paper
Complexity of the robust weighted independent set problems on interval graphs2015-03-25Paper
Approximating Combinatorial Optimization Problems with Uncertain Costs and the OWA Criterion2015-02-12Paper
Recoverable Robust Combinatorial Optimization Problems2015-02-12Paper
Combinatorial optimization problems with uncertain costs and the OWA criterion2014-12-22Paper
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion2014-05-15Paper
Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios2013-07-10Paper
Approximating the min-max (regret) selecting items problem2013-03-21Paper
Parallel Machine Scheduling under Uncertainty2012-12-03Paper
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty2012-08-16Paper
Possibilistic bottleneck combinatorial optimization problems with ill-known weights2012-07-05Paper
On the approximability of robust spanning tree problems2011-02-02Paper
Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems2010-11-08Paper
On the approximability of minmax (regret) network optimization problems2010-06-16Paper
A randomized algorithm for the min-Max selecting items problem with uncertain weights2010-03-01Paper
An approximation algorithm for interval data minmax regret combinatorial optimization problems2009-12-18Paper
Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights2009-12-10Paper
Some methods for evaluating the optimality of elements in matroids with ill-known weights2009-11-17Paper
Choosing robust solutions in discrete optimization problems with fuzzy costs2009-11-17Paper
The minimum spanning tree problem with fuzzy costs2009-07-06Paper
A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids2009-07-02Paper
Efficient Methods for Computing Optimality Degrees of Elements in Fuzzy Weighted Matroids2009-07-02Paper
The 0-1 knapsack problem with fuzzy data2009-02-12Paper
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion2008-09-10Paper
Discrete optimization with interval data. Minmax regret and fuzzy approach2008-05-29Paper
Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems2008-01-02Paper
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data2007-10-30Paper
SOME GENERAL PROPERTIES OF A FUZZY SINGLE MACHINE SCHEDULING PROBLEM2007-05-23Paper
On combinatorial optimization problems on matroids with uncertain weights2006-12-07Paper
The robust shortest path problem in series -- parallel multidigraphs with interval data2006-01-18Paper
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion2005-08-25Paper
Sensitivity analysis in the single-machine scheduling problem with max-min criterion2005-07-04Paper
https://portal.mardi4nfdi.de/entity/Q46671072005-04-19Paper
A possibilistic approach to sequencing problems with fuzzy parameters2005-04-07Paper
Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters.2004-03-15Paper
On two single machine scheduling problems with fuzzy processing times and fuzzy due dates2003-04-28Paper
https://portal.mardi4nfdi.de/entity/Q45195092000-12-03Paper
Robust Min-Max (Regret) Optimization using Ordered Weighted AveragingN/APaper

Research outcomes over time

This page was built for person: Adam Kasperski