 | 2012 |
| 38 |  | Adam Kasperski,
Adam Kurpisz,
Pawel Zielinski:
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty.
European Journal of Operational Research 217(1): 36-43 (2012) |
| 2011 |
| 37 |  | Adam Kasperski,
Pawel Zielinski:
Min-max and two-stage possibilistic combinatorial optimization problems.
FUZZ-IEEE 2011: 2650-2655 |
| 36 |  | Adam Kasperski,
Pawel Zielinski:
Bottleneck Combinatorial Optimization Problems with Fuzzy Scenarios.
NL-MUA 2011: 197-204 |
| 35 |  | Adam Kasperski,
Pawel Zielinski:
Possibilistic Minmax Regret Sequencing Problems With Fuzzy Parameters.
IEEE T. Fuzzy Systems 19(6): 1072-1082 (2011) |
| 34 |  | Adam Kasperski,
Pawel Zielinski:
Possibilistic bottleneck combinatorial optimization problems with ill-known weights.
Int. J. Approx. Reasoning 52(9): 1298-1311 (2011) |
| 33 |  | Adam Kasperski,
Pawel Zielinski:
On the approximability of robust spanning tree problems.
Theor. Comput. Sci. 412(4-5): 365-374 (2011) |
| 2010 |
| 32 |  | Adam Kasperski,
Pawel Zielinski:
Computing Min-Max Regret Solutions in Possibilistic Combinatorial Optimization Problems.
Fuzzy Optimization 2010: 287-312 |
| 31 |  | Barbara Gladysz,
Adam Kasperski:
Computing mean absolute deviation under uncertainty.
Appl. Soft Comput. 10(2): 361-366 (2010) |
| 30 |  | Adam Kasperski,
Pawel Zielinski:
On the approximability of robust spanning tree problems
CoRR abs/1004.2891: (2010) |
| 29 |  | Adam Kasperski,
Pawel Zielinski:
Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights.
European Journal of Operational Research 200(3): 680-687 (2010) |
| 2009 |
| 28 |  | Adam Kasperski,
Pawel Zielinski:
A Possibilistic Approach to Bottleneck Combinatorial Optimization Problems with Ill-Known Weights.
IFSA/EUSFLAT Conf. 2009: 390-395 |
| 27 |  | Adam Kasperski,
Pawel Zielinski:
On Possibilistic Sequencing Problems with Fuzzy Parameters.
IFSA/EUSFLAT Conf. 2009: 426-431 |
| 26 |  | Adam Kasperski,
Pawel Zielinski:
A randomized algorithm for the min-max selecting items problem with uncertain weights.
Annals OR 172(1): 221-230 (2009) |
| 25 |  | Jérôme Fortin,
Adam Kasperski,
Pawel Zielinski:
Some methods for evaluating the optimality of elements in matroids with ill-known weights.
Fuzzy Sets and Systems 160(10): 1341-1354 (2009) |
| 24 |  | Adam Kasperski,
Michal Kulej:
Choosing robust solutions in discrete optimization problems with fuzzy costs.
Fuzzy Sets and Systems 160(5): 667-682 (2009) |
| 23 |  | Adam Kasperski,
Pawel Zielinski:
On the approximability of minmax (regret) network optimization problems.
Inf. Process. Lett. 109(5): 262-266 (2009) |
| 2008 |
| 22 |  | Adam Kasperski:
Discrete Optimization with Interval Data - Minmax Regret and Fuzzy Approach
Springer 2008: 3-207 |
| 21 |  | Adam Kasperski,
Pawel Zielinski:
Solving combinatorial optimization problems with fuzzy weights.
FUZZ-IEEE 2008: 318-323 |
| 20 |  | Adam Kasperski,
Pawel Zielinski:
On possibilistic combinatorial optimization problems.
FUZZ-IEEE 2008: 324-329 |
| 19 |  | Adam Kasperski,
Pawel Zielinski:
On the approximability of minmax (regret) network optimization problems
CoRR abs/0804.0396: (2008) |
| 18 |  | Adam Janiak,
Adam Kasperski:
The minimum spanning tree problem with fuzzy costs.
FO & DM 7(2): 105-118 (2008) |
| 17 |  | Adam Kasperski,
Pawel Zielinski:
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) |
| 2007 |
| 16 |  | Adam Kasperski,
Pawel Zielinski:
Determining Unfuzzy Nondominated Solutions in Combinatorial Optimization Problems with Fuzzy Costs.
FUZZ-IEEE 2007: 1-6 |
| 15 |  | Adam Kasperski,
Pawel Zielinski:
Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems.
IFSA (1) 2007: 656-665 |
| 14 |  | Adam Kasperski,
Pawel Zielinski:
On combinatorial optimization problems on matroids with uncertain weights.
European Journal of Operational Research 177(2): 851-864 (2007) |
| 13 |  | Adam Kasperski,
Michal Kulej:
The 0-1 knapsack problem with fuzzy data.
FO & DM 6(2): 163-172 (2007) |
| 12 |  | Adam Kasperski:
Some General Properties of a Fuzzy Single Machine Scheduling Problem.
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 15(1): 43-56 (2007) |
| 11 |  | Adam Kasperski,
Pawel Zielinski:
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data.
Oper. Res. Lett. 35(4): 525-532 (2007) |
| 2006 |
| 10 |  | Adam Kasperski,
Pawel Zielinski:
An approximation algorithm for interval data minmax regret combinatorial optimization problems.
Inf. Process. Lett. 97(5): 177-180 (2006) |
| 9 |  | Adam Kasperski,
Pawel Zielinski:
The robust shortest path problem in series-parallel multidigraphs with interval data.
Oper. Res. Lett. 34(1): 69-76 (2006) |
| 2005 |
| 8 |  | Adam Kasperski,
Pawel Zielinski:
A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids.
WILF 2005: 46-52 |
| 7 |  | Jérôme Fortin,
Adam Kasperski,
Pawel Zielinski:
Efficient Methods for Computing Optimality Degrees of Elements in Fuzzy Weighted Matroids.
WILF 2005: 99-107 |
| 6 |  | Adam Kasperski:
A possibilistic approach to sequencing problems with fuzzy parameters.
Fuzzy Sets and Systems 150(1): 77-86 (2005) |
| 5 |  | Adam Kasperski:
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion.
Oper. Res. Lett. 33(4): 431-436 (2005) |
| 2004 |
| 4 |  | Stefan Chanas,
Adam Kasperski:
Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters.
Fuzzy Sets and Systems 142(3): 359-371 (2004) |
| 2003 |
| 3 |  | Adam Kasperski:
The fuzzy single machine scheduling problem - some general properties.
EUSFLAT Conf. 2003: 577-581 |
| 2 |  | Stefan Chanas,
Adam Kasperski:
On two single machine scheduling problems with fuzzy processing times and fuzzy due dates.
European Journal of Operational Research 147(2): 281-296 (2003) |
| 2001 |
| 1 |  | Stefan Chanas,
Adam Kasperski:
Possible optimality of solutions in a single machine scheduling problem with fuzzy parameters.
EUSFLAT Conf. 2001: 245-248 |