Chapter 12, Problem 46CRP

Program Plan Intro

Knapsack problem:

The problem of knapsack is that we want a feasible packing of knapsack that maximizes the total value of the packed items, because there are many items that we like to pack and there are not enough room inside the knapsack for everything.

Travelling salesman problem:

The travelling salesman problem is to minimize the travelling cost. The travelling cost between any two cities are different and the aim is to spend less as much as we can and for that we need to determine the sequence of the transversal of the cities so as to minimize the total travel cost.