Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Quadratic_assignment_problem> ?p ?o. }
Showing items 1 to 25 of
25
with 100 items per page.
- Quadratic_assignment_problem abstract "The quadratic assignment problem (QAP) is one of fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics, from the category of the facilities location problems.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 sum of the distances multiplied by the corresponding flows.Intuitively, the cost function encourages factories with high flows between each other to be placed close together.The problem statement resembles that of the assignment problem, except that the cost function is expressed in terms of quadratic inequalities, hence the name.".
- Quadratic_assignment_problem wikiPageExternalLink ant-algorithm-applied-to-the-quadratic-assignment-.
- Quadratic_assignment_problem wikiPageExternalLink qaplib.
- Quadratic_assignment_problem wikiPageID "1636520".
- Quadratic_assignment_problem wikiPageRevisionID "568392507".
- Quadratic_assignment_problem hasPhotoCollection Quadratic_assignment_problem.
- Quadratic_assignment_problem subject Category:Combinatorial_optimization.
- Quadratic_assignment_problem subject Category:NP-hard_problems.
- Quadratic_assignment_problem type Abstraction100002137.
- Quadratic_assignment_problem type Attribute100024264.
- Quadratic_assignment_problem type Condition113920835.
- Quadratic_assignment_problem type Difficulty114408086.
- Quadratic_assignment_problem type NP-hardProblems.
- Quadratic_assignment_problem type Problem114410605.
- Quadratic_assignment_problem type State100024720.
- Quadratic_assignment_problem comment "The quadratic assignment problem (QAP) is one of fundamental combinatorial optimization problems in the branch of optimization or operations research in mathematics, from the category of the facilities location problems.The problem models the following real-life problem:There are a set of n facilities and a set of n locations.".
- Quadratic_assignment_problem label "Problema de la asignación cuadrática".
- Quadratic_assignment_problem label "Quadratic assignment problem".
- Quadratic_assignment_problem sameAs Problema_de_la_asignación_cuadrática.
- Quadratic_assignment_problem sameAs m.05jkbg.
- Quadratic_assignment_problem sameAs Q7268356.
- Quadratic_assignment_problem sameAs Q7268356.
- Quadratic_assignment_problem sameAs Quadratic_assignment_problem.
- Quadratic_assignment_problem wasDerivedFrom Quadratic_assignment_problem?oldid=568392507.
- Quadratic_assignment_problem isPrimaryTopicOf Quadratic_assignment_problem.