$1-2-$center problem cannot be solved in polynomial time by an enumerative algorithm.

$2-$Branch$-$and$-$Bound Cut Algorithm can be adapted in polynomial time.

$3-$SIMPLEX algorithm is a polynomial time algorithm.

$4-$Product of two binary variables cannot be linearized.

$5-$ When the bag sized is fixed the knapsack problem can be solved in polynomial time using dynamic programming.

$6-$Greedy algorithms that we have seen in the scope of IE $343$ are improvement algorithms.

$7-$Stochastic programming is an optimization field that is based optimization under uncertainty.

$8-$Mathematical model for TSP may yield the optimal solution when there are no subtour elimination constraints.

$9-$Exact algorithms cannot be adopted in polynomial time, they are complicated algorithms.