As an argument it takes a profit matrix, a weight vector, the capacity of the knapsack, and finally a boolean solution vector where the solution should be returned. The testqkp algorithm generates instances as described in the above mentioned paper and calls the quadknap code. Average solution times and found solutions are reported. The code 3dbpp.c is a callable C-procedure which can be used as heuristic or exact algorithm. The algorithm generates test instances and calls 3dbpp to solve the problems to optimality.
Output is written to a file for later processing.
The code container.c is a callable C-procedure which can be used in several applications. Output is written to a file for later processing. A readme file with instructions for compilation of the Container Loading algorithm is available here. Back to home .