Results 241 to 250 of about 95,488 (287)

The Quadratic Assignment Problem: A Note

Econometrica, 1972
Results of the Koopmans-Beckmann (K-B) analysis of the quadratic assignment problem [3] have perplexed many location theorists. K-B hold that indivisibilities of plant, in the presence of minimal interaction between spatially separated plants (namely, the shipment of intermediate goods at positive transportation rates), preclude the existence of a ...
openaire   +1 more source

A Heuristic Approach to Quadratic Assignment Problem

Journal of the Operational Research Society, 1980
A new algorithm for solving quadratic assignment problems is presented. The algorithm, which employs a sequential search technique, constructs a matrix of lower bounds on the costs of locating facilities at different sites. It then improves the elements of this matrix, one by one, by solving a succession of linear assignment problems.
Lashkari, R. S., Jaisingh, S. C.
openaire   +2 more sources

Solving Large Quadratic Assignment Problems in Parallel

Computational Optimization and Applications, 1997
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Clausen, Jens, Perregaard, Michael
openaire   +2 more sources

Quadratic and Multidimensional Assignment Problems

2000
In this paper we discuss various aspects regarding nonlinear assignment problems. In particular, we focus on Quadratic Assignment Problems and data association problems which are formulated as Multidimensional Assignment Problems. Computational results with two applications, the turbine balancing problem and multitarget multisensor tracking problem ...
Panos M. Pardalos, Leonidas S. Pitsoulis
openaire   +1 more source

An Algorithm for the Quadratic Assignment Problem

Management Science, 1970
The paper presents a new approach to solving a class of combinatorial economic allocation problems. One member of this class is known as the quadratic assignment problem. Besides presenting an algorithm to solve this problem, we will discuss in general terms the techniques for treating combinatorial problems.
G. W. Graves, A. B. Whinston
openaire   +2 more sources

Constrained neural approaches to quadratic assignment problems

Neural Networks, 1998
In this paper, we discuss analog neural approaches to the quadratic assignment problem (QAP). These approaches employ a hard constraints scheme to restrict the domain space, and are able to obtain much improved solutions over conventional neural approaches.
S, Ishii, M, Sato
openaire   +2 more sources

Asymptotic Properties of the Quadratic Assignment Problem

Mathematics of Operations Research, 1985
For the general quadratic assignment problem as well as for a planar version of this problem, we extend earlier work by Burkard and Fincke to prove that the ratio of the maximal to the minimal solution value converges to 1 almost surely. In fact, any solution value can almost surely be written asymptotically as a simple, explicitly given function of ...
Frenk, J.B.G., Houweninge, van, M., Rinnooy Kan, A.H.G.   +2 more
openaire   +2 more sources

Solving the Quadratic Assignment Problem

1993
We are reporting our experiences with five algorithms, all of them based on simulated annealing, to solve the quadratic assignment problem. This combinatorial problem seeks to assign “n” facilities to “n” locations so that the total flow will be minimized. This problem has many practical applications.
Klaus Andersen, René Victor Valqui Vidal   +1 more
openaire   +1 more source

The Quadratic Assignment Problem

2015
The quadratic assignment problem is reviewed in this chapter. Weights between pairs of facilities and distances between the same number of locations are given. The problem is to find the assignment of facilities to locations that minimizes the weighted sum of distances.
openaire   +1 more source

Hospital Layout as a Quadratic Assignment Problem

Journal of the Operational Research Society, 1977
The problem of locating hospital departments so as to minimize the total distance travelled by patients can be formulated as a Quadratic Assignment Problem. In this paper we discuss some practical considerations of the problem, its formulation, we present a heuristic procedure to solve it and comment on our computational experience with the heuristic.
openaire   +1 more source