Quadratic assignment problem
GPTKB entity
Statements (28)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
mathematical optimization
|
| gptkbp:application |
electronic circuit design
layout design facility location |
| gptkbp:complexity |
gptkb:NP-hard
|
| gptkbp:describedBy |
gptkb:Mathematical_Programming
|
| gptkbp:field |
gptkb:mathematics
computer science operations research |
| gptkbp:hasConstraints |
each facility assigned to one location
each location assigned to one facility |
| gptkbp:hasObjectiveFunction |
minimize total cost of assignment
|
| gptkbp:hasVariables |
assignment of facilities to locations
|
| https://www.w3.org/2000/01/rdf-schema#label |
Quadratic assignment problem
|
| gptkbp:introduced |
gptkb:Tjalling_Koopmans
Martin Beckmann |
| gptkbp:introducedIn |
1957
|
| gptkbp:NP-hardness |
gptkb:NP-hard
|
| gptkbp:relatedTo |
gptkb:traveling_salesman_problem
assignment problem |
| gptkbp:solvedBy |
gptkb:simulated_annealing
gptkb:genetic_algorithms metaheuristics heuristic algorithms branch and bound tabu search |
| gptkbp:bfsParent |
gptkb:Ant_Colony_Optimization
|
| gptkbp:bfsLayer |
8
|