.png){kind=icon}
返回
An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2011.09.012.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces a fast heuristic based algorithm for the max-min multi-scenario knapsack problem. The problem is a variation of the standard 0-1 knapsack problem, in which the profits of the items vary under different scenarios, though the capacity of the knapsack is fixed. The objective of the problem is to find the optimal packing of a set of items so that the minimum total profits of the items in the knapsack over all different scenarios is maximized. For some large-scaled instances, traditional branch-and-bound techniques cannot find an optimal solution within reasonable time, thus we propose a collection of incomplete m-exchange algorithms which are able to produce high quality solutions in just a few minutes of cpu time. Various computational results are also given. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
2-Exchange
Multi-scenario
Knapsack problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Effects of Group Counseling Transmitted Through Videoconferencing on Changes in Eating Behaviors
.png){kind=icon}
PREAI
分享收藏A cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem基于协同局部搜索的多场景最大最小背包问题算法
OAAI
OAAI分享收藏分享收藏
查看更多内容