.png){kind=icon}
返回
Logic cuts for multilevel generalized assignment problems
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(02)00576-3.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. Important manufacturing problems, such as lot sizing, can be easily formulated as MGAPs; however, the large number of variables in the related 0-1 integer program makes it hard to find optimal solutions to these problems, even when using powerful commercial optimization packages. The MGAP includes a set of knapsack constraints, one per agent, that can be useful for generating simple logical constraints or logic cuts. We exploit the fact that logic cuts can be generated in linear time and can be easily added to the model before solving it with classical branch and bound methodology. We generate all contiguous 1-cuts for every knapsack in large MGAP's problems and report the effect of adding these cuts in our experimental results. (C) 2002 Elsevier B.V. All rights reserved.
Keyword:
branch and bound
generalized assignment problem
lot sizing
knapsack constraints
logic cuts
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
查看更多内容