The Wiener maximum quadratic assignment problem
نویسندگان
چکیده
منابع مشابه
The Wiener maximum quadratic assignment problem
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional point set. We show that this special case, which we call the Wiener maximum quadratic assignment problem, is NP-hard in the ordinary sense and solvable in pseudo-polynomial time. Our approach also yields a polynomial time...
متن کاملOn the maximum quadratic assignment problem
Quadratic Assignment is a basic problem in combinatorial optimization, which generalizes several other problems such as Traveling Salesman, Linear Arrangement, Dense k Subgraph, and Clustering with given sizes. The input to the Quadratic Assignment Problem consists of two n × n symmetric non-negative matrices W = (wi,j) and D = (di,j). Given matrices W , D, and a permutation π : [n] → [n], the ...
متن کامل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 ...
متن کامل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 Optimization
سال: 2011
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2011.02.002