What is the exactly equivalent knapsack to an assignment problem?

Abstract

This paper gives the exactly equivalent 0 - 1 Knapsack to an assignment problem of order n; consequently all the assignment problems can be solved rapidly using the equivalent Knapsack and a computer.