Use of deep learning techniques for solving combinatorial problems

Primary tabs

The Deep Neural Networks (DNNs) are powerful models used mostly in the machine learning domain. Nevertheless, a recent research done by Google has shown that DNNs can also help to solve combinatorial problems. The aim of this thesis is to propose an algorithm for solving a simple scheduling, i.e. a combinatorial problem where a deep neural network is helping to search the solution space of the scheduling problem.