Operations Research, Mathematical Programming, Optimization, Algorithms, Discrete Optimization.
optimally and we just need to find a quick solution. Greedy algorithms are used to accomplish this task. They do not usually guarantee optimality (but sometime they do) but they can be very fast. The most famous example is Dijkstra’s algorithm for finding the shortest path problem. Dijkstra is