.png){kind=icon}
Return
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}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Combinatorial optimization
Bottleneck assignment
Approximation
Computational complexity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
The C-Terminal Putative Nuclear Localization Sequence of BReast cancer Metastasis Suppressor 1, BRMS1, Is Necessary for Metastasis Suppression.png)
PLoS ONEOAAI
PLoS ONEIF0
OAAIShareSaveShareSaveAnticancer clinical utility of the apurinic/apyrimidinic endonuclease/redox factor-1 (APE/Ref-1)
OAAI
OAAIShareSaveShareSaveShareSave
View more