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

Complexity of a 3-dimensional assignment problem

Author

Listed:
  • Frieze, A. M.

Abstract

No abstract is available for this item.

Suggested Citation

  • Frieze, A. M., 1983. "Complexity of a 3-dimensional assignment problem," European Journal of Operational Research, Elsevier, vol. 13(2), pages 161-164, June.
    • Handle: RePEc:eee:ejores:v:13:y:1983:i:2:p:161-164
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(83)90078-4
    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.

    Citations

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


    Cited by:

    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. Penn, M.L. & Potts, C.N. & Harper, P.R., 2017. "Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables," European Journal of Operational Research, Elsevier, vol. 262(1), pages 194-206.
    3. Gimadi, Edward Kh., 2015. "Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph," Applied Mathematics and Computation, Elsevier, vol. 255(C), pages 84-91.
    4. Yokoya, Daisuke & Duin, Cees W. & Yamada, Takeo, 2011. "A reduction approach to the repeated assignment problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 185-193, April.
    5. A. T. Ernst & R. G. J. Mills & P. Welgama, 2003. "Scheduling Appointments at Trade Events for the Australian Tourist Commission," Interfaces, INFORMS, vol. 33(3), pages 12-23, June.
    6. Arora, Shalini & Puri, M. C., 1998. "A variant of time minimizing assignment problem," European Journal of Operational Research, Elsevier, vol. 110(2), pages 314-325, October.
    7. Briskorn, Dirk & Drexl, Andreas & Spieksma, Frits C. R., 2005. "Round robin tournaments and three index assignment," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 604, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Kravtsov, M.K. & Lukshin, E.V., 2008. "Polyhedral combinatorics of multi-index axial transportation problems," European Journal of Operational Research, Elsevier, vol. 189(3), pages 920-938, September.
    9. 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.
    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. 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.

    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:eee:ejores:v:13:y:1983:i:2:p:161-164. 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: 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.