IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v194y2009i1p1-17.html
   My bibliography  Save this article

Random assignment problems

Author

Listed:
  • Krokhmal, Pavlo A.
  • Pardalos, Panos M.

Abstract

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.

Suggested Citation

  • Krokhmal, Pavlo A. & Pardalos, Panos M., 2009. "Random assignment problems," European Journal of Operational Research, Elsevier, vol. 194(1), pages 1-17, April.
    • Handle: RePEc:eee:ejores:v:194:y:2009:i:1:p:1-17
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)01146-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Renata M. Aiex & Mauricio G. C. Resende & Panos M. Pardalos & Gerardo Toraldo, 2005. "GRASP with Path Relinking for Three-Index Assignment," INFORMS Journal on Computing, INFORMS, vol. 17(2), pages 224-247, May.
    2. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    3. Egon Balas & Matthew J. Saltzman, 1991. "An Algorithm for the Three-Index Assignment Problem," Operations Research, INFORMS, vol. 39(1), pages 150-161, February.
    4. Mavridou, T. & Pardalos, P.M. & Pitsoulis, L.S. & Resende, Mauricio G.C., 1998. "A GRASP for the biquadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 105(3), pages 613-621, March.
    5. J. B. G. Frenk & M. van Houweninge & A. H. G. Rinnooy Kan, 1985. "Asymptotic Properties of the Quadratic Assignment Problem," Mathematics of Operations Research, INFORMS, vol. 10(1), pages 100-116, February.
    6. D. A. Grundel & C. A. S. Oliveira & P. M. Pardalos, 2004. "Asymptotic Properties of Random Multidimensional Assignment Problems," Journal of Optimization Theory and Applications, Springer, vol. 122(3), pages 487-500, September.
    7. Frenk, J.B.G. & van Houweninge, M. & Rinnooy Kan, A.H.G., 1987. "Order statistics and the linear assignment problem," Econometric Institute Research Papers 11690, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    8. Burkard, Rainer E. & Cela, Eranda, 1995. "Heuristics for biquadratic assignment problems and their computational comparison," European Journal of Operational Research, Elsevier, vol. 83(2), pages 283-300, June.
    9. Carraresi, P. & Gallo, G., 1984. "A multi-level bottleneck assignment approach to the bus drivers' rostering problem," European Journal of Operational Research, Elsevier, vol. 16(2), pages 163-173, May.
    10. Burkard, Rainer E., 1984. "Quadratic assignment problems," European Journal of Operational Research, Elsevier, vol. 15(3), pages 283-289, March.
    11. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    12. Bonomi, Ernesto & Lutton, Jean-Luc, 1986. "The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach," European Journal of Operational Research, Elsevier, vol. 26(2), pages 295-300, August.
    13. Terry Jones & Stephanie Forrest, 1995. "Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms," Working Papers 95-02-022, Santa Fe Institute.
    14. Burkard, Rainer E. & Cela, Eranda & Woeginger, Gerhard J., 1995. "A minimax assignment problem in treelike communication networks," European Journal of Operational Research, Elsevier, vol. 87(3), pages 670-684, December.
    15. Richard M. Karp & Alexander H. G. Rinnooy Kan & Rakesh V. Vohra, 1994. "Average Case Analysis of a Heuristic for the Assignment Problem," Mathematics of Operations Research, INFORMS, vol. 19(3), pages 513-522, August.
    16. Thomas E. Vollmann & Elwood S. Buffa, 1966. "The Facilities Layout Problem in Perspective," Management Science, INFORMS, vol. 12(10), pages 450-468, June.
    17. Wansoo T. Rhee, 1991. "Stochastic Analysis of the Quadratic Assignment Problem," Mathematics of Operations Research, INFORMS, vol. 16(2), pages 223-239, May.
    18. Burkard, R. E. & Karisch, S. & Rendl, F., 1991. "QAPLIB-A quadratic assignment problem library," European Journal of Operational Research, Elsevier, vol. 55(1), pages 115-119, November.
    19. Don A. Grundel & Pavlo A. Krokhmal & Carlos A. S. Oliveira & Panos M. Pardalos, 2007. "On the number of local minima for the multidimensional assignment problem," Journal of Combinatorial Optimization, Springer, vol. 13(1), pages 1-18, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ortega, Josué & Klein, Thilo, 2023. "The cost of strategy-proofness in school choice," Games and Economic Behavior, Elsevier, vol. 141(C), pages 515-528.
    2. Ortega, Josue & Klein, Thilo, 2022. "Improving efficiency and equality in school choice," ZEW Discussion Papers 22-046, ZEW - Leibniz Centre for European Economic Research.
    3. Panayotis Mertikopoulos & Heinrich H. Nax & Bary S. R. Pradelski, 2019. "Quick or cheap? Breaking points in dynamic markets," ECON - Working Papers 338, Department of Economics - University of Zurich.
    4. Li, Xiaobo & Natarajan, Karthik & Teo, Chung-Piaw & Zheng, Zhichao, 2014. "Distributionally robust mixed integer linear programs: Persistency models with applications," European Journal of Operational Research, Elsevier, vol. 233(3), pages 459-473.
    5. Chrétien, Stéphane & Corset, Franck, 2016. "A lower bound on the expected optimal value of certain random linear programs and application to shortest paths in Directed Acyclic Graphs and reliability," Statistics & Probability Letters, Elsevier, vol. 117(C), pages 221-230.
    6. Mordant, Gilles & Segers, Johan, 2021. "Maxima and near-maxima of a Gaussian random assignment field," Statistics & Probability Letters, Elsevier, vol. 173(C).
    7. Mordant, Gilles & Segers, Johan, 2021. "Maxima and near-maxima of a Gaussian random assignment field," LIDAM Discussion Papers ISBA 2021008, Université catholique de Louvain, Institute of Statistics, Biostatistics and Actuarial Sciences (ISBA).
    8. Michael Z. Spivey, 2011. "Asymptotic Moments of the Bottleneck Assignment Problem," Mathematics of Operations Research, INFORMS, vol. 36(2), pages 205-226, May.
    9. Panayotis Mertikopoulos & Heinrich H. Nax & Bary S. R. Pradelski, 2019. "Quick or Cheap? Breaking Points in Dynamic Markets," Cowles Foundation Discussion Papers 2217, Cowles Foundation for Research in Economics, Yale University.
    10. Helena Gaspars-Wieloch, 2021. "The Assignment Problem in Human Resource Project Management under Uncertainty," Risks, MDPI, vol. 9(1), pages 1-17, January.
    11. Kammerdiner, A.R. & Pasiliao, E.L., 2014. "In and out forests on combinatorial landscapes," European Journal of Operational Research, Elsevier, vol. 236(1), pages 78-84.
    12. Mădălina M. Drugan, 2015. "Generating QAP instances with known optimum solution and additively decomposable cost function," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 1138-1172, November.
    13. Sana Bouajaja & Najoua Dridi, 2017. "A survey on human resource allocation problem and its applications," Operational Research, Springer, vol. 17(2), pages 339-369, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Loiola, Eliane Maria & de Abreu, Nair Maria Maia & Boaventura-Netto, Paulo Oswaldo & Hahn, Peter & Querido, Tania, 2007. "A survey for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 657-690, January.
    2. Walteros, Jose L. & Vogiatzis, Chrysafis & Pasiliao, Eduardo L. & Pardalos, Panos M., 2014. "Integer programming models for the multidimensional assignment problem with star costs," European Journal of Operational Research, Elsevier, vol. 235(3), pages 553-568.
    3. Boštjan Gabrovšek & Tina Novak & Janez Povh & Darja Rupnik Poklukar & Janez Žerovnik, 2020. "Multiple Hungarian Method for k -Assignment Problem," Mathematics, MDPI, vol. 8(11), pages 1-18, November.
    4. C.T. Ng & X. Cai & T.C.E. Cheng, 1999. "Probabilistic analysis of an asymptotically optimal solution for the completion time variance problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(4), pages 373-398, June.
    5. Silva, Allyson & Coelho, Leandro C. & Darvish, Maryam, 2021. "Quadratic assignment problem variants: A survey and an effective parallel memetic iterated tabu search," European Journal of Operational Research, Elsevier, vol. 292(3), pages 1066-1084.
    6. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    7. Duc Manh Nguyen & Hoai An Le Thi & Tao Pham Dinh, 2014. "Solving the Multidimensional Assignment Problem by a Cross-Entropy method," Journal of Combinatorial Optimization, Springer, vol. 27(4), pages 808-823, May.
    8. Stefan Helber & Daniel Böhme & Farid Oucherif & Svenja Lagershausen & Steffen Kasper, 2016. "A hierarchical facility layout planning approach for large and complex hospitals," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 5-29, June.
    9. Don A. Grundel & Pavlo A. Krokhmal & Carlos A. S. Oliveira & Panos M. Pardalos, 2007. "On the number of local minima for the multidimensional assignment problem," Journal of Combinatorial Optimization, Springer, vol. 13(1), pages 1-18, January.
    10. Sana Bouajaja & Najoua Dridi, 2017. "A survey on human resource allocation problem and its applications," Operational Research, Springer, vol. 17(2), pages 339-369, July.
    11. Michael, Elad & Wood, Tony A. & Manzie, Chris & Shames, Iman, 2022. "Sensitivity analysis for bottleneck assignment problems," European Journal of Operational Research, Elsevier, vol. 303(1), pages 159-167.
    12. Kim, Bum-Jin & Hightower, William L. & Hahn, Peter M. & Zhu, Yi-Rong & Sun, Lu, 2010. "Lower bounds for the axial three-index assignment problem," European Journal of Operational Research, Elsevier, vol. 202(3), pages 654-668, May.
    13. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    14. Renata M. Aiex & Mauricio G. C. Resende & Panos M. Pardalos & Gerardo Toraldo, 2005. "GRASP with Path Relinking for Three-Index Assignment," INFORMS Journal on Computing, INFORMS, vol. 17(2), pages 224-247, May.
    15. Karsu, Özlem & Azizoğlu, Meral & Alanlı, Kerem, 2021. "Exact and heuristic solution approaches for the airport gate assignment problem," Omega, Elsevier, vol. 103(C).
    16. Werners, Brigitte & Wülfing, Thomas, 2010. "Robust optimization of internal transports at a parcel sorting center operated by Deutsche Post World Net," European Journal of Operational Research, Elsevier, vol. 201(2), pages 419-426, March.
    17. Ajagekar, Akshay & You, Fengqi, 2019. "Quantum computing for energy systems optimization: Challenges and opportunities," Energy, Elsevier, vol. 179(C), pages 76-89.
    18. Hahn, Peter & Grant, Thomas & Hall, Nat, 1998. "A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method," European Journal of Operational Research, Elsevier, vol. 108(3), pages 629-640, August.
    19. Alcaide-López-de-Pablo, David & Sicilia, Joaquín & González-Sierra, Miguel Á., 2017. "Locating names on vertices of a transaction network," European Journal of Operational Research, Elsevier, vol. 262(2), pages 464-478.
    20. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:194:y:2009:i:1:p:1-17. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.