Orienteering is a sport in which start and end points are specified along with other locations. These other locations have associated scores. In a fixed amount of time, Competitors seek to visit, a subset of these locations on the way from the start point to the endpoint to maximize the total score. A Greedy Randomized Adaptive Search Procedure (GRASP) for finding the most rewarding path within a travel budget.
A greedy heuristic to solve the set covering problem.
Source about combinatorics available here
This shows a clustering method based on the K-Means upon a set of Nodes in the euclidean space. Information was taken from here
Greedy Heuristic based on Ratios (Price/Weight) for the Knapsack Problem
Shortest path problem solved by Dijkstra Algorithm. Source code and background available at: https://learn.microsoft.com/en-us/previous-versions/ms379574(v=vs.80)#datastructures20_5_topic3