Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Quadratic_bottleneck_assignment_problem> ?p ?o. }
Showing items 1 to 21 of
21
with 100 items per page.
- Quadratic_bottleneck_assignment_problem 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.↑".
- Quadratic_bottleneck_assignment_problem wikiPageID "27414761".
- Quadratic_bottleneck_assignment_problem wikiPageRevisionID "585314570".
- Quadratic_bottleneck_assignment_problem hasPhotoCollection Quadratic_bottleneck_assignment_problem.
- Quadratic_bottleneck_assignment_problem subject Category:Combinatorial_optimization.
- Quadratic_bottleneck_assignment_problem subject Category:NP-hard_problems.
- Quadratic_bottleneck_assignment_problem type Abstraction100002137.
- Quadratic_bottleneck_assignment_problem type Attribute100024264.
- Quadratic_bottleneck_assignment_problem type Condition113920835.
- Quadratic_bottleneck_assignment_problem type Difficulty114408086.
- Quadratic_bottleneck_assignment_problem type NP-hardProblems.
- Quadratic_bottleneck_assignment_problem type Problem114410605.
- Quadratic_bottleneck_assignment_problem type State100024720.
- Quadratic_bottleneck_assignment_problem 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. ".
- Quadratic_bottleneck_assignment_problem label "Quadratic bottleneck assignment problem".
- Quadratic_bottleneck_assignment_problem sameAs m.0b_zwfb.
- Quadratic_bottleneck_assignment_problem sameAs Q7268355.
- Quadratic_bottleneck_assignment_problem sameAs Q7268355.
- Quadratic_bottleneck_assignment_problem sameAs Quadratic_bottleneck_assignment_problem.
- Quadratic_bottleneck_assignment_problem wasDerivedFrom Quadratic_bottleneck_assignment_problem?oldid=585314570.
- Quadratic_bottleneck_assignment_problem isPrimaryTopicOf Quadratic_bottleneck_assignment_problem.