//-->
A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data
Kasperski, Adam, (2012)
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
Kasperski, Adam, (2008)