Hamid R. Amirazizi

Learn More
Extended Abstract Given a vector a=(al, a~ ..... u.,~) where each % is a positive integer, and an integer S, the knapsack problem is to fond a binary vector x=(zb z2 ..... z-,~) such that ll (1) i=l The associated decision problem, i.e.,determining whether (i) has a solution, is Lb. the class of NP-Complete problems. Therefore it is believed that solving(More)
  • 1