In this introduction to Fortran 90 and its later updates we will be looking at what exactly it is that makes Fortran still such a good choice today, as well as how to get started with it.

It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

Integer programming, a cornerstone of combinatorial optimisation, focuses on the selection of discrete decision variables to solve complex real‐world problems such as scheduling, network design ...