What is the exactly equivalent knapsack to an assignment problem?

Ι. - Χ. Π. Παναγιωτόπουλος


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.


Assignment; Linear analysis; Mathematical models

Full Text:


η δικτυακή πύλη της ευρωπαϊκής ένωσης ψηφιακή ελλάδα ΕΣΠΑ 2007-2013