IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v16y1968i2p422-431.html
   My bibliography  Save this article

Letter to the Editor—The Multidimensional Assignment Problem

Author

Listed:
  • William P. Pierskalla

    (Case Western Reserve University, Cleveland, Ohio)

Abstract

The multidimensional assignment problem is a higher dimensional version of the standard (two-dimensional) assignment problem in the literature. The higher dimensions can be thought of as time or space dimensions or both. An algorithm is proposed for the solution of the multi-index assignment problem. The algorithm is based on a tree search technique of the branch-and-bound variety. It uses dual subproblems to provide easily computed bounds for the primal assignment problem.

Suggested Citation

  • William P. Pierskalla, 1968. "Letter to the Editor—The Multidimensional Assignment Problem," Operations Research, INFORMS, vol. 16(2), pages 422-431, April.
    • Handle: RePEc:inm:oropre:v:16:y:1968:i:2:p:422-431
    DOI: 10.1287/opre.16.2.422
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.16.2.422
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.16.2.422?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. P. Senthil Kumar, 2020. "Developing a New Approach to Solve Solid Assignment Problems Under Intuitionistic Fuzzy Environment," International Journal of Fuzzy System Applications (IJFSA), IGI Global, vol. 9(1), pages 1-34, January.
    2. Benjamin Lev, 2010. "Book Reviews," Interfaces, INFORMS, vol. 40(6), pages 480-485, December.
    3. P. Senthil Kumar, 2020. "Algorithms for solving the optimization problems using fuzzy and intuitionistic fuzzy set," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 11(1), pages 189-222, February.
    4. H-J Bandelt & A Maas & F C R Spieksma, 2004. "Local search heuristics for multi-index assignment problems with decomposable costs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 694-704, July.
    5. 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.
    6. L Wan & J F Bard, 2007. "Weekly staff scheduling with workstation group restrictions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(8), pages 1030-1046, August.
    7. Alla Kammerdiner & Alexander Semenov & Eduardo L. Pasiliao, 2022. "Multidimensional Assignment Problem for Multipartite Entity Resolution," Journal of Global Optimization, Springer, vol. 84(2), pages 491-523, October.
    8. Zvi Drezner & Pawel Kalczynski, 2017. "The continuous grey pattern problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(5), pages 469-483, May.
    9. 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.
    10. Vladyslav Sokol & Ante Ćustić & Abraham P. Punnen & Binay Bhattacharya, 2020. "Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms," INFORMS Journal on Computing, INFORMS, vol. 32(3), pages 730-746, July.
    11. 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.
    12. Alla R. Kammerdiner & Andre N. Guererro, 2019. "Data-driven combinatorial optimization for sensor-based assessment of near falls," Annals of Operations Research, Springer, vol. 276(1), pages 137-153, May.
    13. Maurice Queyranne & Frits Spieksma & Fabio Tardella, 1998. "A General Class of Greedily Solvable Linear Programs," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 892-908, November.
    14. 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.

    More about this item

    Statistics

    Access and download statistics

    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:inm:oropre:v:16:y:1968:i:2:p:422-431. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.