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

An algorithm for the quadratic assignment problem using Bender's decomposition

Author

Listed:
  • Kaufman, L.
  • Broeckx, F.

Abstract

No abstract is available for this item.

Suggested Citation

  • Kaufman, L. & Broeckx, F., 1978. "An algorithm for the quadratic assignment problem using Bender's decomposition," European Journal of Operational Research, Elsevier, vol. 2(3), pages 207-211, May.
    • Handle: RePEc:eee:ejores:v:2:y:1978:i:3:p:207-211
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(78)90095-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. Sven Boge & Sigrid Knust, 2023. "The blocks relocation problem with item families minimizing the number of reshuffles," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(2), pages 395-435, June.
    3. Ravi Kumar, K. & Hadjinicola, George C. & Lin, Ting-li, 1995. "A heuristic procedure for the single-row facility layout problem," European Journal of Operational Research, Elsevier, vol. 87(1), pages 65-73, November.
    4. Matteo Fischetti & Michele Monaci & Domenico Salvagnin, 2012. "Three Ideas for the Quadratic Assignment Problem," Operations Research, INFORMS, vol. 60(4), pages 954-964, August.
    5. Fernando Stefanello & Vaneet Aggarwal & Luciana S. Buriol & Mauricio G. C. Resende, 2019. "Hybrid algorithms for placement of virtual machines across geo-separated data centers," Journal of Combinatorial Optimization, Springer, vol. 38(3), pages 748-793, October.
    6. Fedjki, Chawki A. & Duffuaa, Salih O., 2004. "An extreme point algorithm for a local minimum solution to the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 156(3), pages 566-578, August.
    7. Ebery, Jamie, 2001. "Solving large single allocation p-hub problems with two or three hubs," European Journal of Operational Research, Elsevier, vol. 128(2), pages 447-458, January.
    8. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    9. Yang Wang & Wei Yang & Abraham P. Punnen & Jingbo Tian & Aihua Yin & Zhipeng Lü, 2021. "The Rank-One Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 979-996, July.
    10. A Diponegoro & B R Sarker, 2003. "Machine assignment in a nonlinear multi-product flowline," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(5), pages 472-489, May.
    11. Ketan Date & Rakesh Nagi, 2019. "Level 2 Reformulation Linearization Technique–Based Parallel Algorithms for Solving Large Quadratic Assignment Problems on Graphics Processing Unit Clusters," INFORMS Journal on Computing, INFORMS, vol. 31(4), pages 771-789, October.
    12. Ball, Michael O. & Kaku, Bharat K. & Vakhutinsky, Andrew, 1998. "Network-based formulations of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 104(1), pages 241-249, January.
    13. Abdelaziz, Fouad Ben & Maddah, Bacel & Flamand, Tülay & Azar, Jimmy, 2024. "Store-Wide space planning balancing impulse and convenience," European Journal of Operational Research, Elsevier, vol. 312(1), pages 211-226.
    14. Feizollahi, Mohammad Javad & Feyzollahi, Hadi, 2015. "Robust quadratic assignment problem with budgeted uncertain flows," Operations Research Perspectives, Elsevier, vol. 2(C), pages 114-123.
    15. Raymond G. Vickson & Elkafi Hassini & Nader Azad, 2020. "A Benders decomposition approach to product location in carousel storage systems," Annals of Operations Research, Springer, vol. 284(2), pages 623-643, January.
    16. Sarker, Bhaba R. & Wilhelm, Wilbert E. & Hogg, Gary L., 1998. "One-dimensional machine location problems in a multi-product flowline with equidistant locations," European Journal of Operational Research, Elsevier, vol. 105(3), pages 401-426, March.
    17. Nyberg, Axel & Westerlund, Tapio, 2012. "A new exact discrete linear reformulation of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 314-319.
    18. Jingyang Zhou & Peter E.D. Love & Kok Lay Teo & Hanbin Luo, 2017. "An exact penalty function method for optimising QAP formulation in facility layout problem," International Journal of Production Research, Taylor & Francis Journals, vol. 55(10), pages 2913-2929, May.
    19. Enrique Domínguez & Alfredo Marín, 2020. "Discrete ordered median problem with induced order," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 28(3), pages 793-813, October.
    20. Kim, J. -Y. & Kim, Y. -D., 1995. "Graph theoretic heuristics for unequal-sized facility layout problems," Omega, Elsevier, vol. 23(4), pages 391-401, August.
    21. Huizhen Zhang & Cesar Beltran-Royo & Liang Ma, 2013. "Solving the quadratic assignment problem by means of general purpose mixed integer linear programming solvers," Annals of Operations Research, Springer, vol. 207(1), pages 261-278, August.

    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:2:y:1978:i:3:p:207-211. 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.