Adam Kasperski
Adam Kasperski
Department of Operations Research, Wrocław University of Technology
Zweryfikowany adres z pwr.edu.pl - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
An approximation algorithm for interval data minmax regret combinatorial optimization problems
A Kasperski, P Zieliński
Information Processing Letters 97 (5), 177-180, 2006
1632006
Discrete optimization with interval data
A Kasperski
Springer, 2008
1112008
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
A Kasperski
Operations Research Letters 33 (4), 431-436, 2005
932005
Minimizing maximum lateness in a single machine scheduling problem with fuzzy processing times and fuzzy due dates
S Chanas, A Kasperski
Engineering Applications of Artificial Intelligence 14 (3), 377-386, 2001
752001
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
A Kasperski, P Zieliński
Operations Research Letters 36 (3), 343-344, 2008
692008
Robust discrete optimization under discrete and interval uncertainty: A survey
A Kasperski, P Zieliński
Robustness analysis in decision aiding, optimization, and analytics, 113-143, 2016
682016
The robust shortest path problem in series–parallel multidigraphs with interval data
A Kasperski, P Zieliński
Operations Research Letters 34 (1), 69-76, 2006
632006
On two single machine scheduling problems with fuzzy processing times and fuzzy due dates
S Chanas, A Kasperski
European Journal of Operational Research 147 (2), 281-296, 2003
612003
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
A Kasperski, A Kurpisz, P Zieliński
European Journal of Operational Research 217 (1), 36-43, 2012
522012
The minimum spanning tree problem with fuzzy costs
A Janiak, A Kasperski
Fuzzy Optimization and Decision Making 7 (2), 105-118, 2008
422008
On the approximability of robust spanning tree problems
A Kasperski, P Zieliński
Theoretical Computer Science 412 (4-5), 365-374, 2011
382011
Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters
S Chanas, A Kasperski
Fuzzy Sets and Systems 142 (3), 359-371, 2004
382004
Choosing robust solutions in discrete optimization problems with fuzzy costs
A Kasperski, M Kulej
Fuzzy Sets and Systems 160 (5), 667-682, 2009
372009
Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
A Kasperski, P Zieliński
European Journal of Operational Research 200 (3), 680-687, 2010
352010
On combinatorial optimization problems on matroids with uncertain weights
A Kasperski, P Zieliński
European Journal of Operational Research 177 (2), 851-864, 2007
352007
On the approximability of minmax (regret) network optimization problems
A Kasperski, P Zieliński
Information Processing Letters 109 (5), 262-266, 2009
302009
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
A Kasperski, P Zieliński
Operations Research Letters 35 (4), 525-532, 2007
302007
A possibilistic approach to sequencing problems with fuzzy parameters
A Kasperski
Fuzzy Sets and Systems 150 (1), 77-86, 2005
272005
Using gradual numbers for solving fuzzy-valued combinatorial optimization problems
A Kasperski, P Zieliński
International Fuzzy Systems Association World Congress, 656-665, 2007
252007
Approximating the min–max (regret) selecting items problem
A Kasperski, A Kurpisz, P Zieliński
Information Processing Letters 113 (1-2), 23-29, 2013
242013
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20