.png){kind=icon}
返回
On an assignment problem with side constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/S0360-8352(00)00015-2.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We describe a branch and bound algorithm for an assignment problem subject to a special set of side constraints. The problem has application in the design of tool carousels for certain flexible manufacturing systems. The resulting model represents a special case of the restricted facilities layout problem in which it is forbidden to locate any facility in certain zones. The bounds for the algorithm are generated by relaxing the side constraints and using the Hungarian method to solve the resulting assignment problem. Partitioning in a manner similar to subtour elimination for the travelling salesman problem leads to encouraging computational results. (C) 2000 Published by Elsevier Science Ltd. All rights reserved.
Keyword:
algorithms
assignment
heuristics
integer programming
side constraints
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
暂无机构信息
引用论文
Structural basis of ribosomal frameshifting during translation of the SARS-CoV-2 RNA genomeSARS-CoV-2 RNA基因组翻译过程中核糖体移码的结构基础.png)
Science
OAAI
ScienceIF0
OAAI分享收藏分享收藏
Hydrothermal preparation and low temperature magnetic properties of TbOOH, DyOOH, HoOOH, ErOOH, and YbOOHTbOOH，DyOOH，HoOOH，ErOOH和YbOOH的水热制备和低温磁性
PREAI
分享收藏A FACET GENERATION AND RELAXATION TECHNIQUE APPLIED TO AN ASSIGNMENT PROBLEM WITH SIDE CONSTRAINTSOAAI
OAAI分享收藏
查看更多内容