Quadratic bottleneck assignment problem
id:
quadratic-bottleneck-assignment-problem-299-3335125
title:
Quadratic bottleneck assignment problem
text:
In mathematics, the quadratic bottleneck assignment problem (QBAP) is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research, from the category of the facilities location problems. It is related to the quadratic assignment problem in the same way as the linear bottleneck assignment problem is related to the linear assignment problem, the "sum" is replaced with "max" in the objective function. The problem models the following real-life prob
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Quadratic_bottleneck_assignment_problem
date created:
date modified:
2023-10-16T07:26:36Z
main entity:
{"identifier":"Q7268355","url":"https://www.wikidata.org/entity/Q7268355"}
image:
fields total:
13
integrity:
13