Similar Search Results

Robustness in operational research and decision aiding: A multi-faceted issue

Kasperski, Adam; Zieliński, Paweł - In: European journal of operational research : EJOR 200 (2010) 3, pp. 629-639

Persistent link: https://www.econbiz.de/10008349292

Linear transformations to decrease computational requirements of solving some known linear programming models

Kasperski, Adam; Zieliński, Paweł - 2009

Persistent link: https://www.econbiz.de/10008343144

On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data

Kasperski, Adam; Zieliński, Paweł - In: Operations research letters 35 (2007) 4, pp. 525-532

Persistent link: https://www.econbiz.de/10007769962

On combinatorial optimization problems on matroids with uncertain weights

Kasperski, Adam; Zieliński, Paweł - In: European journal of operational research : EJOR 177 (2007) 2, pp. 851-864

Persistent link: https://www.econbiz.de/10007772620

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-626

Persistent link: https://www.econbiz.de/10009992599

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/10008052196

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-44

Persistent link: https://www.econbiz.de/10009818481

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-345

Persistent link: https://www.econbiz.de/10008883405

Approximating a two-machine flow shop scheduling under discrete scenario uncertainty

Kasperski, Adam; Kurpisz, Adam; Zieliński, Paweł - In: European Journal of Operational Research 217 (2012) 1, pp. 36-43

This paper deals with the two machine permutation flow shop problem with uncertain data, whose deterministic counterpart is known to be polynomially solvable. In this paper, it is assumed that job processing times are uncertain and they are specified as a discrete scenario set. For this...

Persistent link: https://www.econbiz.de/10011052395

Propagation of waves and chaos in transmission line with strongly anharmonic dangling resonator

Zieliński, P.; Kułak, A.; Dobrzyński, L.; … - In: The European Physical Journal B - Condensed Matter and … 32 (2003) 1, pp. 73-79

Persistent link: https://www.econbiz.de/10009282476