Results 1 
8 of
8
The Quadratic Assignment Problem
 HANDBOOK OF COMBINATORIAL OPTIMIZATION, P. PARDALOS AND D.Z. DU, EDS.
, 1998
"... 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, an ..."
Abstract

Cited by 115 (3 self)
 Add to MetaCart
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 biquadratic assignment problem, and discusses the relationship between the QAP and other well known combinatorial optimization problems, e.g. the traveling salesman problem, the graph partitioning problem, etc. The paper will appear in the Handbook of Combinatorial Optimization to be published by Kluwer Academic Publishers, P. Pardalos and D.Z. Du, eds.
Frequency Assignment Problems
 HANDBOOK OF COMBINATORIAL OPTIMIZATION
, 1999
"... The ever growing number of wireless communications systems deployed around the globe have made the optimal assignment of a limited radio frequency spectrum a problem of primary importance. At issue are planning models for permanent spectrum allocation, licensing, regulation, and network design. Furt ..."
Abstract

Cited by 34 (3 self)
 Add to MetaCart
The ever growing number of wireless communications systems deployed around the globe have made the optimal assignment of a limited radio frequency spectrum a problem of primary importance. At issue are planning models for permanent spectrum allocation, licensing, regulation, and network design. Further at issue are online algorithms for dynamically assigning frequencies to users within an established network. Applications include aeronautical mobile, land mobile, maritime mobile, broadcast, land fixed (pointto point), and satellite systems. This paper surveys research conducted by theoreticians, engineers, and computer scientists regarding the frequency assignment problem (FAP) in all of its guises. The paper begins by defining some of the more common types of FAPs. It continues with a discussion on measures of optimality relating to the use of spectrum, models of interference, and mathematical representations of the many FAPs, both in graph theoretic terms, and as mathematical pro...
Selected Topics on Assignment Problems
, 1999
"... We survey recent developments in the fields of bipartite matchings, linear sum assignment and bottleneck assignment problems and applications, multidimensional assignment problems, quadratic assignment problems, in particular lower bounds, special cases and asymptotic results, biquadratic and co ..."
Abstract

Cited by 26 (1 self)
 Add to MetaCart
We survey recent developments in the fields of bipartite matchings, linear sum assignment and bottleneck assignment problems and applications, multidimensional assignment problems, quadratic assignment problems, in particular lower bounds, special cases and asymptotic results, biquadratic and communication assignment problems.
An Asymptotical Study of Combinatorial Optimization Problems By Means of Statistical Mechanics
, 1998
"... . The analogy between combinatorial optimization and statistical mechanics has proven to be a fruitful object of study. Simulated annealing, a metaheuristic for combinatorial optimization problems, is based on this analogy. In this paper we use the statistical mechanics formalism based on the above ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
. The analogy between combinatorial optimization and statistical mechanics has proven to be a fruitful object of study. Simulated annealing, a metaheuristic for combinatorial optimization problems, is based on this analogy. In this paper we use the statistical mechanics formalism based on the above mentioned analogy to analyze the asymptotic behavior of a special class of combinatorial optimization problems characterized by a combinatorial conditions which is well known in the literature. Our result is analogous to results of other authors derived by purely probabilistic means: Under natural probabilistic conditions on the coefficients of the problem, the ratio between the optimal value and size of a feasible solution approaches almost surely the expected value of the coefficients, as the size of the problem tends to infinity. Our proof shows clearly why the above mentioned combinatorial condition which characterizes the class of investigated problems is essential. Keywords: combinato...
A NOTE ON THE ASYMPTOTIC BEHAVIOUR OF BOTTLENECK PROBLEMS
"... Abstract. We generalize and sharpen results of Burkard and Fincke concerning the asymptotic behaviour of a certain class of combinatorial optimization problems with bottleneck objective function. In this way several open questions are answered. 1. ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We generalize and sharpen results of Burkard and Fincke concerning the asymptotic behaviour of a certain class of combinatorial optimization problems with bottleneck objective function. In this way several open questions are answered. 1.
An Asymptotical Study of Combinatorial Optimization by Means of Statistical Mechanics
, 2003
"... The analogy between combinatorial optimization and statistical mechanics has proven to be a fruitful object of study. Simulated annealing, a metaheuristic for combinatorial optimization problems, is based on this analogy. In this paper ..."
Abstract
 Add to MetaCart
The analogy between combinatorial optimization and statistical mechanics has proven to be a fruitful object of study. Simulated annealing, a metaheuristic for combinatorial optimization problems, is based on this analogy. In this paper
JStatPhys(2011)145:734–744 DOI 10.1007/s1095501103086 The Random Quadratic Assignment Problem
"... Abstract The quadratic assignment problem, QAP, is one of the most difficult of all combinatorial optimization problems. Here, we use an abbreviated application of the statistical mechanics replica method to study the asymptotic behavior of instances in which the entries of at least one of the two m ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract The quadratic assignment problem, QAP, is one of the most difficult of all combinatorial optimization problems. Here, we use an abbreviated application of the statistical mechanics replica method to study the asymptotic behavior of instances in which the entries of at least one of the two matrices that specify the problem are chosen from a random distribution P.Surprisingly,theQAPhasnotbeenstudiedbeforeusingthereplicamethod despite the fact that the QAP was first proposed over 50 years ago and the replica method was developed over 30 years ago. We find simple forms for Cmin and Cmax, thecostsofthe minimal and maximum solutions respectively. Notable features of our results are the symmetry of the results for Cmin and Cmax and their dependence on P only through its mean and standard deviation, independent of the details of P.