Best reduction of the quadratic semi-assignment problem
نویسندگان
چکیده
منابع مشابه
Semi Quadratic Assignment Problem
Changing the QAP's hard definition such that the facilities M are allowed to be mapped by a (single-valued, not necessarily injective) function π into the set of possible locations Y subject to a relation Π, π ⊆ Π, it arises the Semi-QAP that might be regarded as a relaxation of the QAP. In contrast to the Tree-QAP (flow graph F is a tree) the corresponding Semi-Tree-QAP is solvable in polynomi...
متن کاملRobust Quadratic Assignment Problem with Uncertain Locations
We consider a generalization of the classical quadratic assignment problem, where coordinates of locations are uncertain and only upper and lower bounds are known for each coordinate. We develop a mixed integer linear programming model as a robust counterpart of the proposed uncertain model. A key challenge is that, since the uncertain model involves nonlinear objective function of the ...
متن کاملLower bounds for the Quadratic Semi-Assignment Problem
In this paper we will present class of new lower bounds for the Quadratic Semi-Assignment Problem (QSAP). These bounds are based on recent results about polynomially solvable cases, in particular we will consider the QSAP's whose quadratic cost coefficients define a reducible graph. Several lower bounds will be computationally compared, moreover we will present a method which improves these bou...
متن کاملThe Quadratic Assignment Problem
This paper aims at describing the state of the art on quadratic assignment problems (QAPs). It discusses the most important developments in all aspects of the QAP such as linearizations, QAP polyhedra, algorithms to solve the problem to optimality, heuristics, polynomially solvable special cases, and asymptotic behavior. Moreover, it also considers problems related to the QAP, e.g. the biquadra...
متن کاملThe Generalized Quadratic Assignment Problem
We study a generalization of the quadratic assignment problem (QAP) by allowing multiple equipments to be assigned at a single location as long as resources at the location permit. This problem arises in many real world applications such as facility location problem and logistics network design. We call the problem as the generalized quadratic assignment problem (GQAP) and show that this relaxa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2001
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(00)00257-2