Optimization, Algorithms, Heuristics, Operations Research, Python.
best_sol In my GitHub repository, you will find an example of a 32-node graph in which the adaptive greedy found a subset of 5 vertices, but a random framework with multi-start found a solution with 6. The solution procedure is represented below. Solution procedure of constructive heuristic applied