rar

Research on kernel-based MMKP algorithm

  • 2013-09-22
  • 519.29KB
  • Points it Requires : 2

  The multidimensional multi-choice knapsack problem (MMKP) is an extension of the 0-1 knapsack problem. The knapsack kernel has been used to design efficient algorithms for solving the knapsack problem. The purpose is to study how to obtain a knapsack kernel and use it to efficiently solve the multidimensional multi-choice knapsack problem. First, a method is given to determine the kernel of the MMKP. Then, the B&B algorithm that uses the kernel to accurately solve the MMKP problem is explained, and the specific algorithm steps are listed. After analyzing the storage complexity of the algorithm, the running results of the algorithm on various instances are compared with the running results of the commonly used algorithms for solving the MMKP problem. It is found that the performance of this algorithm is better than any previous algorithm.

unfold

You Might Like

Uploader
lamas
 

Recommended ContentMore

Popular Components

Just Take a LookMore

EEWorld
subscription
account

EEWorld
service
account

Automotive
development
circle

About Us Customer Service Contact Information Datasheet Sitemap LatestNews


Room 1530, 15th Floor, Building B, No.18 Zhongguancun Street, Haidian District, Beijing, Postal Code: 100190 China Telephone: 008610 8235 0740

Copyright © 2005-2024 EEWORLD.com.cn, Inc. All rights reserved 京ICP证060456号 京ICP备10001474号-1 电信业务审批[2006]字第258号函 京公网安备 11010802033920号
×