Abdelghani Bellaachia, Algorithms - 1 -Greedy Method˜Objective:˜General approach:•Given a set of n inputs.•Find a subset, called feasible solution, of the ninputs subject to some constraints, andsatisfying a given objective function.•If the objective function is maximized orminimized, the feasible solution is optimal.•It is a locally optimal method.˜Algorithm:FStep 1: Choose an input from the input set, based onsome criterion. If no more input exit.FStep 2: Check whether the chosen input yields to afeasible solution. If no, discard the input andgoto step 1.FStep 3: Include the input into the solution vector andupdate the objective function. Goto step 1.
has intentionally blurred sections.
Sign up to view the full version.