Narrow search
Showing 1 - 5 of 5
Cover Image
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
Kasperski, Adam; Zieliński, Paweł - In: Operations research letters 36 (2008) 3, pp. 343-344
Persistent link: https://www.econbiz.de/10003773804
Cover Image
A tabu search algorithm for the minmax regret minimum spanning tree problem with interval data
Kasperski, Adam; Makuchowski, Mariusz; Zieliński, Paweł - In: Journal of heuristics 18 (2012) 4, pp. 593-625
Persistent link: https://www.econbiz.de/10009577724
Cover Image
Approximating a two-machine flow shop scheduling under discrete scenario uncertainty
Kasperski, Adam; Kurpisz, Adam; Zieliński, Paweł - In: European journal of operational research : EJOR 217 (2012) 1, pp. 36-43
Persistent link: https://www.econbiz.de/10009388680
Cover Image
Approximating combinatorial optimization problems with the ordered weighted averaging criterion
Chassein, André; Goerigk, Marc; Kasperski, Adam; … - In: European journal of operational research : EJOR 286 (2020) 3, pp. 828-838
Persistent link: https://www.econbiz.de/10012291575
Cover Image
Risk-averse single machine scheduling : complexity and approximation
Kasperski, Adam; Zieliński, Paweł - In: Journal of scheduling 22 (2019) 5, pp. 567-580
Persistent link: https://www.econbiz.de/10012117022