The Travelling Thief Problem
A discussion of the relatively new Travelling Thief Problem; a merger of the well-known Travelling Salesman and 0-1 knapsack problems, plus a brief foray into computational complexity.
A discussion of the relatively new Travelling Thief Problem; a merger of the well-known Travelling Salesman and 0-1 knapsack problems, plus a brief foray into computational complexity.
12 of the best games I played in 2019.
This final SHPC post briefly covers the basics of OpenMP and MPI.
A brief overview of some of the major graph models in the field of complex networks.
A brief overview of some methods for mathematical optimisation.
We explore three methods of solving the Schrödinger equation for the purpose of estimating the energy eigenvalues.
A discussion of numerical methods to solve ODEs (Euler, Runge-Kutta), as well as root finding with the Bisection Method.
A brief introduction to the fundamentals of Fortran.