Details about Adam Kasperski

Access statistics for papers by Adam Kasperski.

Last updated 2021-04-11. Update your information in the RePEc Author Service.

Short-id: pka525

Working Papers

2019

1. Production planning under demand uncertainty: a budgeted uncertainty approach
   Post-Print, HAL
   See also Chapter Production Planning Under Demand Uncertainty: A Budgeted Uncertainty Approach, Operations Research Proceedings, Springer (2020) (2020)

Journal Articles

2021

1. Combinatorial two-stage minmax regret problems under interval uncertainty
   Annals of Operations Research, 2021, 300, (1), 23-50 View citations (1)

2020

2. Approximating combinatorial optimization problems with the ordered weighted averaging criterion
   European Journal of Operational Research, 2020, 286, (3), 828-838 View citations (2)

2019

3. Risk-averse single machine scheduling: complexity and approximation
   Journal of Scheduling, 2019, 22, (5), 567-580 View citations (2)
4. Robust recoverable 0–1 optimization problems under polyhedral uncertainty
   European Journal of Operational Research, 2019, 278, (1), 136-148

2018

5. On recoverable and two-stage robust selection problems with budgeted uncertainty
   European Journal of Operational Research, 2018, 265, (2), 423-436 View citations (9)

2017

6. Recoverable robust spanning tree problem under interval uncertainty representations
   Journal of Combinatorial Optimization, 2017, 34, (2), 554-573 View citations (3)

2012

7. A computational study of approximation algorithms for a minmax resource allocation problem
   Operations Research and Decisions, 2012, 22, (2), 35-43
8. Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
   European Journal of Operational Research, 2012, 217, (1), 36-43 View citations (5)

2010

9. Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
   European Journal of Operational Research, 2010, 200, (3), 680-687 View citations (4)

2009

10. A randomized algorithm for the min-max selecting items problem with uncertain weights
    Annals of Operations Research, 2009, 172, (1), 221-230 View citations (2)

2008

11. Making Robust Decisions in Discrete Optimization Problems as a Game against Nature
    Czech Economic Review, 2008, 2, (3), 237-250

2007

12. On combinatorial optimization problems on matroids with uncertain weights
    European Journal of Operational Research, 2007, 177, (2), 851-864 View citations (3)

2003

13. On two single machine scheduling problems with fuzzy processing times and fuzzy due dates
    European Journal of Operational Research, 2003, 147, (2), 281-296 View citations (4)
14. Sensitivity analysis in sequencing problems
    Operations Research and Decisions, 2003, 13, (4), 85-96

Chapters

2020

1. Production Planning Under Demand Uncertainty: A Budgeted Uncertainty Approach
   Springer
   See also Working Paper Production planning under demand uncertainty: a budgeted uncertainty approach, HAL (2019) (2019)
2. Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty
   Springer View citations (1)

2018

3. Risk Averse Scheduling with Scenarios
   Springer

2017

4. Robust Two-Stage Network Problems
   Springer View citations (1)

2016

5. Robust Discrete Optimization Problems with the WOWA Criterion
   Springer
6. Robust Discrete Optimization Under Discrete and Interval Uncertainty: A Survey
   Springer View citations (10)
7. Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion
   Springer View citations (1)

2014

8. Approximating Combinatorial Optimization Problems with Uncertain Costs and the OWA Criterion
   Springer
9. Recoverable Robust Combinatorial Optimization Problems
   Springer
10. Sequencing Problems with Uncertain Parameters and the OWA Criterion
    Springer