Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 194, Issue 1, Pages 1-17Publisher
ELSEVIER
DOI: 10.1016/j.ejor.2007.11.062
Keywords
Random assignment problems; Linear assignment problem; Quadratic assignment problem; Multidimensional assignment problem; Bottleneck assignment problem; Probabilistic analysis; Asymptotic analysis; Fitness landscape analysis
Funding
- NSF [0430709, 0457473]
- U.S. Air Force [FA8651-071-0001]
- AFOSR [FA9550-07-1-0047]
- Direct For Computer & Info Scie & Enginr
- Division of Computing and Communication Foundations [0430709] Funding Source: National Science Foundation
- Div Of Civil, Mechanical, & Manufact Inn
- Directorate For Engineering [0457473] Funding Source: National Science Foundation
Ask authors/readers for more resources
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. (c) 2007 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available
Share Paper
