(+36) 88 424 483

   Egyetem str. 10, Building I, 9th floor, Veszprém H-8200

  

Thesis

Description: Combinatorial algorithms for process-network synthesis are crucial elements of the P-graph framework capable to solve a broad range of engineering optimization problems. Because of the combinatorial nature of the problem, the computational effort required may increase exponentially, thus effective software implementation is needed. Current implementation utilizes multicore systems based on OpenMP. Testing additional implementation techniques including C++14, and comparison with the actual best practice is highly desirable.

Supervisor: Botond Bertók

Contact: