Description: Greedy Algorithm (GA) is used for the uation of the same case presented for the
Branch and Bound method in Section 5.2. Particular heuristic criteria are created to
choose the new solution point for each step of the algorithm.
To Search:
File list (Check if you may need any files):
greedy.m
Download