Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q7268355> ?p ?o }
Showing triples 1 to 19 of
19
with 100 triples per page.
- Q7268355 subject Q8391417.
- Q7268355 subject Q9059596.
- Q7268355 abstract "In mathematics, the quadratic bottleneck assignment problem (QBAP) is one of 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 problem:There are a set of n facilities and a set of n locations. For each pair of locations, a distance is specified and for each pair of facilities a weight or flow is specified (e.g., the amount of supplies transported between the two facilities). The problem is to assign all facilities to different locations with the goal of minimizing the maximum of the distances multiplied by the corresponding flows.↑".
- Q7268355 wikiPageWikiLink Q1036748.
- Q7268355 wikiPageWikiLink Q1137554.
- Q7268355 wikiPageWikiLink Q1305598.
- Q7268355 wikiPageWikiLink Q1333872.
- Q7268355 wikiPageWikiLink Q141495.
- Q7268355 wikiPageWikiLink Q194292.
- Q7268355 wikiPageWikiLink Q273037.
- Q7268355 wikiPageWikiLink Q4949085.
- Q7268355 wikiPageWikiLink Q5597073.
- Q7268355 wikiPageWikiLink Q620614.
- Q7268355 wikiPageWikiLink Q6553416.
- Q7268355 wikiPageWikiLink Q7268356.
- Q7268355 wikiPageWikiLink Q8391417.
- Q7268355 wikiPageWikiLink Q9059596.
- Q7268355 comment "In mathematics, the quadratic bottleneck assignment problem (QBAP) is one of 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 problem:There are a set of n facilities and a set of n locations. ".
- Q7268355 label "Quadratic bottleneck assignment problem".