I know of no tutorial, but I believe that the problem formulation is not hard. Use intlinprog. To maximize the value of the items in the knapsack, have the objective function vector f be the negative of the value of each item ( intlinprog minimizes, so to maximize, minimize the negative). Linear constraints, such as the total weight, can be easily included in the linear inequality constraint matrix A and the vector b.
Alan Weiss
MATLAB mathematical toolbox documentation
