default search action
Adam Kasperski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j47]Romain Guillaume, Adam Kasperski, Pawel Zielinski
:
A framework of distributionally robust possibilistic optimization. Fuzzy Optim. Decis. Mak. 23(2): 253-278 (2024) - [c31]Adam Kasperski, Pawel Zielinski
Recoverable Possibilistic Linear Programming. FUZZ 2024: 1-8 - [i28]Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski:
Recoverable robust shortest path problem under interval uncertainty representations. CoRR abs/2401.05715 (2024) - [i27]Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski:
Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse. CoRR abs/2403.20000 (2024) - [i26]Adam Kasperski, Pawel Zielinski:
Computational complexity of the recoverable robust shortest path problem in acyclic digraphs. CoRR abs/2410.09425 (2024) - 2023
- [j46]Romain Guillaume
Distributionally robust possibilistic optimization problems. Fuzzy Sets Syst. 454: 56-73 (2023) - [j45]Marc Goerigk, Romain Guillaume, Adam Kasperski
Robust optimization with belief functions. Int. J. Approx. Reason. 159: 108941 (2023) - [i25]Marc Goerigk, Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Robust optimization with belief functions. CoRR abs/2303.05067 (2023) - [i24]Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski:
Solving the recoverable robust shortest path problem in DAGs. CoRR abs/2309.02816 (2023) - 2022
- [j44]Marc Goerigk
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty. J. Comb. Optim. 43(3): 497-527 (2022) - [j43]Romain Guillaume
Robust inventory problem with budgeted cumulative demand uncertainty. Optim. Lett. 16(9): 2543-2556 (2022) - [j42]Adam Kasperski, Pawel Zielinski
Solving Robust Production Planning Problem with Interval Budgeted Uncertainty in Cumulative Demands. Vietnam. J. Comput. Sci. 9(3): 285-296 (2022) - [i23]Romain Guillaume, Adam Kasperski, Pawel Zielinski:
A framework of distributionally robust possibilistic optimization. CoRR abs/2210.15193 (2022) - 2021
- [j41]Marc Goerigk, Adam Kasperski
Combinatorial two-stage minmax regret problems under interval uncertainty. Ann. Oper. Res. 300(1): 23-50 (2021) - [j40]Adam Kasperski, Pawel Zielinski
Soft robust solutions to possibilistic optimization problems. Fuzzy Sets Syst. 422: 130-148 (2021) - [c30]Romain Guillaume
Distributionally Robust Optimization in Possibilistic Setting. FUZZ-IEEE 2021: 1-6 - [c29]Romain Guillaume
Robust optimization with scenarios using random fuzzy sets. FUZZ-IEEE 2021: 1-6 - [c28]Romain Guillaume
Robust Possibilistic Optimization with Copula Function. FUZZ-IEEE 2021: 1-6 - [c27]Romain Guillaume, Adam Kasperski, Pawel Zielinski
Robust Optimization with Scenarios Using Belief Functions. OR 2021: 114-119 - [i22]Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Distributionally robust possibilistic optimization problems. CoRR abs/2111.14071 (2021) - 2020
- [j39]André B. Chassein, Marc Goerigk, Adam Kasperski
Approximating combinatorial optimization problems with the ordered weighted averaging criterion. Eur. J. Oper. Res. 286(3): 828-838 (2020) - [j38]Marc Goerigk
Two-stage combinatorial optimization problems under risk. Theor. Comput. Sci. 804: 29-45 (2020) - [c26]Romain Guillaume
Robust Possibilistic Production Planning Under Budgeted Demand Uncertainty. FUZZ-IEEE 2020: 1-8 - [c25]Romain Guillaume, Adam Kasperski
Softening the Robustness of Optimization Problems: A New Budgeted Uncertainty Approach. IPMU (1) 2020: 187-200 - [i21]Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Combinatorial two-stage minmax regret problems under interval uncertainty. CoRR abs/2005.10610 (2020) - [i20]Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Robust production planning with budgeted cumulative demand uncertainty. CoRR abs/2009.05736 (2020)
2010 – 2019
- 2019
- [j37]Mikita Hradovich, Adam Kasperski, Pawel Zielinski
Robust recoverable 0-1 optimization problems under polyhedral uncertainty. Eur. J. Oper. Res. 278(1): 136-148 (2019) - [j36]Adam Kasperski
Risk-averse single machine scheduling: complexity and approximation. J. Sched. 22(5): 567-580 (2019) - [c24]Adam Kasperski
A (Soft) Robustness for Possibilistic Optimization Problems. FUZZ-IEEE 2019: 1-6 - [c23]Marc Goerigk, Adam Kasperski, Pawel Zielinski
Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty. OR 2019: 423-429 - [c22]Romain Guillaume
Production Planning Under Demand Uncertainty: A Budgeted Uncertainty Approach. OR 2019: 431-437 - [i19]Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Robust two-stage combinatorial optimization problems under convex uncertainty. CoRR abs/1905.02469 (2019) - [i18]Adam Kasperski, Pawel Zielinski:
Soft robust solutions to possibilistic optimization problems. CoRR abs/1912.01516 (2019) - 2018
- [j35]André B. Chassein, Marc Goerigk
On recoverable and two-stage robust selection problems with budgeted uncertainty. Eur. J. Oper. Res. 265(2): 423-436 (2018) - [i17]André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Approximating multiobjective combinatorial optimization problems with the OWA criterion. CoRR abs/1804.03594 (2018) - [i16]Adam Kasperski, Pawel Zielinski:
Approximating some network problems with scenarios. CoRR abs/1806.08936 (2018) - [i15]Mikita Hradovich, Adam Kasperski, Pawel Zielinski:
Robust recoverable 0-1 optimization problems under polyhedral uncertainty. CoRR abs/1811.06719 (2018) - [i14]Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Two-stage Combinatorial Optimization Problems under Risk. CoRR abs/1812.07826 (2018) - 2017
- [j34]Adam Kasperski
Robust recoverable and two-stage selection problems. Discret. Appl. Math. 233: 52-64 (2017) - [j33]Mikita Hradovich, Adam Kasperski
Recoverable robust spanning tree problem under interval uncertainty representations. J. Comb. Optim. 34(2): 554-573 (2017) - [j32]Mikita Hradovich, Adam Kasperski
The recoverable robust spanning tree problem with interval costs is polynomially solvable. Optim. Lett. 11(1): 17-30 (2017) - [c21]Mikita Hradovich, Adam Kasperski, Pawel Zielinski
Risk Averse Scheduling with Scenarios. OR 2017: 435-441 - [i13]André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski:
On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty. CoRR abs/1701.06064 (2017) - [i12]Adam Kasperski, Pawel Zielinski:
Risk averse single machine scheduling - complexity and approximation. CoRR abs/1712.03371 (2017) - 2016
- [j31]Adam Kasperski
Using the WOWA operator in robust discrete optimization problems. Int. J. Approx. Reason. 68: 54-67 (2016) - [j30]Adam Kasperski
Single machine scheduling problems with uncertain parameters and the OWA criterion. J. Sched. 19(2): 177-190 (2016) - [c20]Adam Kasperski, Pawel Zielinski
A robust approach to a class of uncertain optimization problems with imprecise probabilities. FUZZ-IEEE 2016: 1606-1613 - [i11]Mikita Hradovich, Adam Kasperski, Pawel Zielinski:
The robust recoverable spanning tree problem with interval costs is polynomially solvable. CoRR abs/1602.07422 (2016) - [i10]Mikita Hradovich, Adam Kasperski, Pawel Zielinski:
Recoverable robust spanning tree problem under interval uncertainty representations. CoRR abs/1606.01342 (2016) - 2015
- [j29]Adam Kasperski
Complexity of the robust weighted independent set problems on interval graphs. Optim. Lett. 9(3): 427-436 (2015) - [j28]Adam Kasperski
Approximability of the robust representatives selection problem. Oper. Res. Lett. 43(1): 16-19 (2015) - [j27]Adam Kasperski
Combinatorial optimization problems with uncertain costs and the OWA criterion. Theor. Comput. Sci. 565: 102-112 (2015) - [c19]Adam Kasperski
Robust Two-Stage Network Problems. OR 2015: 35-40 - [i9]Adam Kasperski, Pawel Zielinski:
Using the WOWA operator in robust discrete optimization problems. CoRR abs/1504.07863 (2015) - [i8]Adam Kasperski, Pawel Zielinski:
Robust recoverable and two-stage selection problems. CoRR abs/1505.06893 (2015) - 2014
- [c18]Adam Kasperski, Pawel Zielinski
Robust Discrete Optimization Problems with the WOWA Criterion. OR 2014: 271-277 - [c17]Adam Kasperski, Pawel Zielinski
Robust Single Machine Scheduling Problem with Weighted Number of Late Jobs Criterion. OR 2014: 279-284 - [i7]Adam Kasperski, Pawel Zielinski:
Single machine scheduling problems with uncertain parameters and the OWA criterion. CoRR abs/1405.5371 (2014) - [i6]Adam Kasperski, Pawel Zielinski:
Complexity of the robust weighted independent set problems on interval graphs. CoRR abs/1405.5376 (2014) - [i5]Adam Kasperski, Adam Kurpisz, Pawel Zielinski:
Approximability of the robust representatives selection problem. CoRR abs/1405.5381 (2014) - 2013
- [j26]Adam Kasperski
Approximating the min-max (regret) selecting items problem. Inf. Process. Lett. 113(1-2): 23-29 (2013) - [j25]Adam Kasperski
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion. Oper. Res. Lett. 41(6): 639-643 (2013) - [c16]Adam Kasperski
Sequencing Problems with Uncertain Parameters and the OWA Criterion. OR 2013: 223-229 - [i4]Adam Kasperski, Pawel Zielinski:
Combinatorial optimization problems with uncertain costs and the OWA criterion. CoRR abs/1305.5339 (2013) - [i3]Adam Kasperski, Pawel Zielinski:
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion. CoRR abs/1307.4521 (2013) - 2012
- [j24]Adam Kasperski
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty. Eur. J. Oper. Res. 217(1): 36-43 (2012) - [j23]Adam Kasperski
A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data. J. Heuristics 18(4): 593-625 (2012) - [c15]Adam Kasperski
Parallel Machine Scheduling under Uncertainty. IPMU (4) 2012: 74-83 - [c14]Adam Kasperski
Approximating Combinatorial Optimization Problems with Uncertain Costs and the OWA Criterion. OR 2012: 141-146 - [c13]Adam Kasperski
Recoverable Robust Combinatorial Optimization Problems. OR 2012: 147-153 - 2011
- [j22]Adam Kasperski
Possibilistic bottleneck combinatorial optimization problems with ill-known weights. Int. J. Approx. Reason. 52(9): 1298-1311 (2011) - [j21]Adam Kasperski
On the approximability of robust spanning tree problems. Theor. Comput. Sci. 412(4-5): 365-374 (2011) - [j20]Adam Kasperski
Possibilistic Minmax Regret Sequencing Problems With Fuzzy Parameters. IEEE Trans. Fuzzy Syst. 19(6): 1072-1082 (2011) - [c12]Adam Kasperski, Pawel Zielinski
Min-max and two-stage possibilistic combinatorial optimization problems. FUZZ-IEEE 2011: 2650-2655 - [c11]Adam Kasperski, Pawel Zielinski
Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios. NL-MUA 2011: 197-204 - 2010
- [j19]Barbara Gladysz, Adam Kasperski
Computing mean absolute deviation under uncertainty. Appl. Soft Comput. 10(2): 361-366 (2010) - [j18]Adam Kasperski
Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights. Eur. J. Oper. Res. 200(3): 680-687 (2010) - [p1]Adam Kasperski, Pawel Zielinski
Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems. Fuzzy Optimization 2010: 287-312 - [i2]Adam Kasperski, Pawel Zielinski:
On the approximability of robust spanning tree problems. CoRR abs/1004.2891 (2010)
2000 – 2009
- 2009
- [j17]Adam Kasperski
A randomized algorithm for the min-max selecting items problem with uncertain weights. Ann. Oper. Res. 172(1): 221-230 (2009) - [j16]Adam Kasperski
Choosing robust solutions in discrete optimization problems with fuzzy costs. Fuzzy Sets Syst. 160(5): 667-682 (2009) - [j15]Jérôme Fortin, Adam Kasperski
Some methods for evaluating the optimality of elements in matroids with ill-known weights. Fuzzy Sets Syst. 160(10): 1341-1354 (2009) - [j14]Adam Kasperski
On the approximability of minmax (regret) network optimization problems. Inf. Process. Lett. 109(5): 262-266 (2009) - [c10]Adam Kasperski, Pawel Zielinski:
A Possibilistic Approach to Bottleneck Combinatorial Optimization Problems with Ill-Known Weights. IFSA/EUSFLAT Conf. 2009: 390-395 - [c9]Adam Kasperski, Pawel Zielinski:
On Possibilistic Sequencing Problems with Fuzzy Parameters. IFSA/EUSFLAT Conf. 2009: 426-431 - 2008
- [b1]Adam Kasperski:
Discrete Optimization with Interval Data - Minmax Regret and Fuzzy Approach. Studies in Fuzziness and Soft Computing 228, Springer 2008, ISBN 978-3-540-78483-8, pp. 3-207 [contents] - [j13]Adam Janiak, Adam Kasperski
The minimum spanning tree problem with fuzzy costs. Fuzzy Optim. Decis. Mak. 7(2): 105-118 (2008) - [j12]Adam Kasperski
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion. Oper. Res. Lett. 36(3): 343-344 (2008) - [c8]Adam Kasperski, Pawel Zielinski
Solving combinatorial optimization problems with fuzzy weights. FUZZ-IEEE 2008: 318-323 - [c7]Adam Kasperski, Pawel Zielinski
On possibilistic combinatorial optimization problems. FUZZ-IEEE 2008: 324-329 - [i1]Adam Kasperski, Pawel Zielinski:
On the approximability of minmax (regret) network optimization problems. CoRR abs/0804.0396 (2008) - 2007
- [j11]Adam Kasperski
On combinatorial optimization problems on matroids with uncertain weights. Eur. J. Oper. Res. 177(2): 851-864 (2007) - [j10]Adam Kasperski
The 0-1 knapsack problem with fuzzy data. Fuzzy Optim. Decis. Mak. 6(2): 163-172 (2007) - [j9]Adam Kasperski
Some General Properties of a Fuzzy Single Machine Scheduling Problem. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 15(1): 43-56 (2007) - [j8]Adam Kasperski
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data. Oper. Res. Lett. 35(4): 525-532 (2007) - [c6]Adam Kasperski
Determining Unfuzzy Nondominated Solutions in Combinatorial Optimization Problems with Fuzzy Costs. FUZZ-IEEE 2007: 1-6 - [c5]Adam Kasperski, Pawel Zielinski
Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems. IFSA (1) 2007: 656-665 - 2006
- [j7]Adam Kasperski
An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inf. Process. Lett. 97(5): 177-180 (2006) - [j6]Adam Kasperski
The robust shortest path problem in series-parallel multidigraphs with interval data. Oper. Res. Lett. 34(1): 69-76 (2006) - 2005
- [j5]Adam Kasperski
A possibilistic approach to sequencing problems with fuzzy parameters. Fuzzy Sets Syst. 150(1): 77-86 (2005) - [j4]Stefan Chanas, Adam Kasperski
Sensitivity analysis in the single-machine scheduling problem with max-min criterion. Int. Trans. Oper. Res. 12(3): 287-298 (2005) - [j3]Adam Kasperski
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion. Oper. Res. Lett. 33(4): 431-436 (2005) - [c4]Adam Kasperski
A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids. WILF 2005: 46-52 - [c3]Jérôme Fortin, Adam Kasperski
Efficient Methods for Computing Optimality Degrees of Elements in Fuzzy Weighted Matroids. WILF 2005: 99-107 - 2004
- [j2]Stefan Chanas, Adam Kasperski
Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters. Fuzzy Sets Syst. 142(3): 359-371 (2004) - 2003
- [j1]Stefan Chanas, Adam Kasperski
On two single machine scheduling problems with fuzzy processing times and fuzzy due dates. Eur. J. Oper. Res. 147(2): 281-296 (2003) - [c2]Adam Kasperski:
The fuzzy single machine scheduling problem - some general properties. EUSFLAT Conf. 2003: 577-581 - 2001
- [c1]Stefan Chanas, Adam Kasperski:
Possible optimality of solutions in a single machine scheduling problem with fuzzy parameters. EUSFLAT Conf. 2001: 245-248
Coauthor Index
[j47] [c31] [i28] [i27] [i26] [j46] [j45] [i25] [i24] [j44] [j43] [j42] [i23] [j41] [j40] [c30] [c29] [c28] [c27] [i22] [j39] [j38] [c26] [c25] [i21] [i20] [j37] [j36] [c24] [c23] [c22] [i19] [i18] [j35] [i17] [i16] [i15] [i14] [j34] [j33] [j32] [c21] [i13] [i12] [j31] [j30] [c20] [i11] [i10] [j29] [j28] [j27] [c19] [i9] [i8] [c18] [c17] [i7] [i6] [i5] [j26] [j25] [c16] [i4] [i3] [j24] [j23] [c15] [c14] [c13] [j22] [j21] [j20] [c12] [c11] [j18] [p1] [i2] [j17] [j15] [j14] [c10] [c9] [j12] [c8] [c7] [i1] [j11] [j8] [c6] [c5] [j7] [j6] [c4] [c3]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-25 22:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: