Kasperski Adam

Adam Kasperski

Information about the author Adam Kasperski will soon be added to the site.
Found 10 papers in total
Recoverable robust spanning tree problem under interval uncertainty representations
2017
This paper deals with the recoverable robust spanning tree problem under interval...
Approximating the min‐max (regret) selecting items problem
2013
In this paper the problem of selecting p items out of n available to minimize the...
Approximating a two‐machine flow shop scheduling under discrete scenario uncertainty
2012
This paper deals with the two machine permutation flow shop problem with uncertain...
A randomized algorithm for the min-max selecting items problem with uncertain weights
2009
This paper deals with the min-max version of the problem of selecting p items of the...
On combinatorial optimization problems on matroids with uncertain weights
2007
In this paper the combinatorial optimization problem on weighted matroid is...
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data
2007
The general problem of minimizing the maximal regret in combinatorial optimization...
Sensitivity analysis in the single-machine scheduling problem with max–min criterion
2005
In this paper, the single-machine scheduling problem 1|prec|fmax is...
The robust shortest path problem in series–parallel multidigraphs with interval data
2006
In this paper the robust shortest path problem in edge series–parallel...
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion
2005
In this paper, the single machine sequencing problem with maximum lateness criterion...
On two single machine scheduling problems with fuzzy processing times and fuzzy due dates
2003
Two single machines scheduling problems with fuzzy processing times and fuzzy due...
Papers per page: