Random assignment problems
Analysis of random instances of optimization problems provides valuable insights into the behavior and properties of problem's solutions, feasible region, and optimal values, especially in large-scale cases. A class of problems that have been studied extensively in the literature using the methods of probabilistic analysis is represented by the assignment problems, and many important problems in operations research and computer science can be formulated as assignment problems. This paper presents an overview of the recent results and developments in the area of probabilistic assignment problems, including the linear and multidimensional assignment problems, quadratic assignment problem, etc.
Year of publication: |
2009
|
---|---|
Authors: | Krokhmal, Pavlo A. ; Pardalos, Panos M. |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 194.2009, 1, p. 1-17
|
Publisher: |
Elsevier |
Keywords: | Random assignment problems Linear assignment problem Quadratic assignment problem Multidimensional assignment problem Bottleneck assignment problem Probabilistic analysis Asymptotic analysis Fitness landscape analysis |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Krokhmal, Pavlo A., (2009)
-
On the Hamming distance in combinatorial optimization problems on hypergraph matchings
Kammerdiner, Alla, (2010)
-
Krokhmal, Pavlo A., (2009)
- More ...