$(1)0/1$ knapsack $$ greedy approach$.$

$(2)$ Dynamic Programming $0/1$ knapsack recursive property$.$

$(3)$ Backtracking state space tree $($profit$,$ weight, bound $)$

$(4)$ Breath$-$first$-$search with branch$-$and$-$bound prunning state space tree $($profit$,$ weight, bound $)$

$(5)$Best$-$first$-$search with branch$-$and$-$bound prunning state space tree $($profit$,$ weight, bound $)$