1957
DOI: 10.2307/1907742
|View full text |Cite
|
Sign up to set email alerts
|

Assignment Problems and the Location of Economic Activities

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

2
810
0
31

Year Published

2003
2003
2017
2017

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 1,870 publications
(843 citation statements)
references
References 0 publications
2
810
0
31
Order By: Relevance
“…The solution of QAP (also denoted as QAP (F, D, B)) can be defined in permutation form π = (π(1), …, π(n)) of the set of n elements (facilities). In the Koopmans-Beckmann [11] model the purpose is to find the permutation π* which minimizes the objective function:…”
Section: Koopmans-beckmann Quadratic Assignment Problemmentioning
confidence: 99%
“…The solution of QAP (also denoted as QAP (F, D, B)) can be defined in permutation form π = (π(1), …, π(n)) of the set of n elements (facilities). In the Koopmans-Beckmann [11] model the purpose is to find the permutation π* which minimizes the objective function:…”
Section: Koopmans-beckmann Quadratic Assignment Problemmentioning
confidence: 99%
“…Previous research has developed several formulations for optimizing facility layout problems. For discrete formulations, the quadratic assignment problems (QAP) [4] is the most commonly encountered in the literature.…”
Section: Problem Solving Techniques For Facility Layoutmentioning
confidence: 99%
“…The objective function used in this research is based on the concept proposed by Koopmans and Beckman [4]. Equation (1) is the objective function, which is a weighted average of two parts.…”
Section: Function-space Assignmentmentioning
confidence: 99%
“…Em 1957, Koopmans e Beckmann, [KB57], idealizaram o Problema Quadrático de Alocação como um problema de layout, quando pretenderam instalar pares de n fábricas a pares de n locais, a custo mínimo, de modo que cada fábrica fosse atribuída a um único local e reciprocamente. Hoje, sabemos que o PQA é um dos mais difíceis problemas de Otimização Combinatória pertencente à classe NP-hard.…”
Section: Introductionunclassified
“…(1) Formulações por Programação Inteira são dadas por programação binária, como a de [KB57], ou por Programação Mista, como as de [KB78], [FY83] e [PR96]. Nesta linha, diversos limites inferiores do tipo linear foram determinados, inclusive um dos mais antigos deles, conhecido por limite de Gilmore e Lawler e suas variações, [Gi62] e [La63];…”
Section: Introductionunclassified