Quadratic assignment problem: Difference between revisions

Revision as of 16:30, 14 January 2021

Revision as of 10:45, 14 April 2021

Line 6:

: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 factoriesfacilities with high flows between each other to be placed close together.

The problem statement resembles that of the [[assignment problem]], except that the [[Loss function|cost function]] is expressed in terms of quadratic inequalities, hence the name.