.png){kind=icon}
返回
Cost based filtering for the constrained knapsack problem
.png){kind=icon}
PRE
AI
DOI：10.1023/A:1021193019522.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present cost based filtering methods for Knapsack Problems (KPs). Cost based filtering aims at fixing variables with respect to the objective function. It is an important technique when solving complex problems such as Quadratic Knapsack Problems, or KPs with additional constraints (Constrained Knapsack Problems (CKPs)). They evolve, e.g., when Constraint Based Column Generation is applied to appropriate optimization problems. We develop new reduction algorithms for KP. They are used as propagation routines for the CKP with Theta(n log n) preprocessing time and Theta(n) time per call. This sums up to an amortized time Theta(n) for Omega(log n) incremental calls where the subsequent problems may differ with respect to arbitrary sets of necessarily included and excluded items.
Keyword:
constraint programming
constrained knapsack problems
cost based filtering
optimization constraints
reduction algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
