.png){kind=icon}
返回
Multi-level bottleneck assignment problems: Complexity and sparsity-exploiting formulations
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2023.106213.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study the multi-level bottleneck assignment problem: given a weight matrix, the task is to rearrange entries in each column such that the maximum sum of values in each row is as small as possible. We analyze the complexity of this problem in a generalized setting, where a graph models restrictions how values in columns can be permuted. We present a lower bound on its approximability by giving a non-trivial gap reduction from three-dimensional matching to the multi-level bottleneck assignment problem. We present new integer programming formulations and consider the impact of graph density on problem hardness in numerical experiments.
Keyword:
Combinatorial optimization
Bottleneck assignment
Approximation
Computational complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
The C-Terminal Putative Nuclear Localization Sequence of BReast cancer Metastasis Suppressor 1, BRMS1, Is Necessary for Metastasis Suppression.png)
PLoS ONEOAAI
PLoS ONEIF0
OAAI分享收藏Anticancer clinical utility of the apurinic/apyrimidinic endonuclease/redox factor-1 (APE/Ref-1)
OAAI
OAAI分享收藏分享收藏
查看更多内容