Constructive heuristics..

Successfully constructs a feasible solution Often used for first time solutions A common type is “greedy algorithm” Starts with no prior solutions and finishes when feasible solution is found Called greedy because it only looks for what’s best in the next step Examples for TSP: Nearest neighbor, Nearest insertion, Nearest merger