| 2009 |
|---|
| 19 | EE | Adam Kasperski,
Michal Kulej:
Choosing robust solutions in discrete optimization problems with fuzzy costs.
Fuzzy Sets and Systems 160(5): 667-682 (2009) |
| 18 | EE | Adam Kasperski,
Pawel Zielinski:
On the approximability of minmax (regret) network optimization problems.
Inf. Process. Lett. 109(5): 262-266 (2009) |
| 2008 |
|---|
| 17 | EE | Adam Kasperski,
Pawel Zielinski:
On the approximability of minmax (regret) network optimization problems
CoRR abs/0804.0396: (2008) |
| 16 | EE | 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 |
|---|
| 15 | EE | Adam Kasperski,
Pawel Zielinski:
Determining Unfuzzy Nondominated Solutions in Combinatorial Optimization Problems with Fuzzy Costs.
FUZZ-IEEE 2007: 1-6 |
| 14 | EE | Adam Kasperski,
Pawel Zielinski:
Using Gradual Numbers for Solving Fuzzy-Valued Combinatorial Optimization Problems.
IFSA (1) 2007: 656-665 |
| 13 | EE | Adam Kasperski,
Pawel Zielinski:
On combinatorial optimization problems on matroids with uncertain weights.
European Journal of Operational Research 177(2): 851-864 (2007) |
| 12 | EE | 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 | EE | 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 | EE | Adam Kasperski,
Pawel Zielinski:
An approximation algorithm for interval data minmax regret combinatorial optimization problems.
Inf. Process. Lett. 97(5): 177-180 (2006) |
| 9 | EE | 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 | EE | Adam Kasperski,
Pawel Zielinski:
A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids.
WILF 2005: 46-52 |
| 7 | EE | 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 | EE | Adam Kasperski:
A possibilistic approach to sequencing problems with fuzzy parameters.
Fuzzy Sets and Systems 150(1): 77-86 (2005) |
| 5 | EE | 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 | EE | 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 | EE | Adam Kasperski:
The fuzzy single machine scheduling problem - some general properties.
EUSFLAT Conf. 2003: 577-581 |
| 2 | EE | 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 | EE | Stefan Chanas,
Adam Kasperski:
Possible optimality of solutions in a single machine scheduling problem with fuzzy parameters.
EUSFLAT Conf. 2001: 245-248 |
