Tag: OR

In April I was fortunate enough to get to go to the lake district for an event hosted by STOR-i and the Centre for Research Training in Foundations of Data Science from the Republic of Ireland. At this event I got the opportunity to present a poster, this can be found below. The poster is […]

Read more

Recently, I published blog post introducing the concept of heuristic search, this can be found here. Which was followed up with a discussion linear space search methods, in particular branch and bound, which can be found here. This blog is a continuation of these, in which some selective search methods will be discussed. In order to […]

Read more

Recently, I published blog post introducing the concept of heuristic search, this can be found here. This is a continuation of that post, in which I will discuss linear space search methods, in particular branch and bound. Linear space search methods involve the exploration of a search tree in a systematic exploration of the solution space for […]

Read more

Heuristic search A heuristic in the most common sense is a method involving adapting the approach to a problem based on previous solutions to similar problems. These approaches aim to be easily and quickly applicable to a range of problems, so as to find approximate solutions quickly without using the time and resources to develop and execute […]

Read more