Solving the Fractional Knapsack Problem
While the 0/1 Knapsack problem restricts you to take an item entirely, Fractional Knapsack problem allows you to take fractions of an item.
Tag: greedy
Travelling Salesman Problem using Nearest Neighbour Algorithm
Given a list of cities and the distances between each pair of cities, find the shortest possible route that visits each city exactly once and returns to the origin city.