Yan-Yan Tan

Learn More
—The 0/1 knapsack problem is a well-known problem, which appears in many real domains with practical importance. The problem is NP-complete. The multiob-jective 0/1 knapsack problem is a generalization of the 0/1 knapsack problem in which multiple knapsacks are considered. Many algorithms have been proposed in the past five decades for both single and(More)
  • 1