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

A parallel depth first search branch and bound algorithm for the quadratic assignment problem

Author

Listed:
  • Mans, Bernard
  • Mautor, Thierry
  • Roucairol, Catherine

Abstract

No abstract is available for this item.

Suggested Citation

  • Mans, Bernard & Mautor, Thierry & Roucairol, Catherine, 1995. "A parallel depth first search branch and bound algorithm for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 81(3), pages 617-628, March.
    • Handle: RePEc:eee:ejores:v:81:y:1995:i:3:p:617-628
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(93)E0334-T
    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. Paolo Carraresi & Federico Malucelli, 1992. "A New Lower Bound for the Quadratic Assignment Problem," Operations Research, INFORMS, vol. 40(1-supplem), pages 22-27, February.
    2. Gordon C. Armour & Elwood S. Buffa, 1963. "A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities," Management Science, INFORMS, vol. 9(2), pages 294-309, January.
    3. Michael Scriabin & Roger C. Vergin, 1975. "Comparison of Computer Algorithms and Visual Based Methods for Plant Layout," Management Science, INFORMS, vol. 22(2), pages 172-181, October.
    4. Christopher E. Nugent & Thomas E. Vollmann & John Ruml, 1968. "An Experimental Comparison of Techniques for the Assignment of Facilities to Locations," Operations Research, INFORMS, vol. 16(1), pages 150-173, February.
    5. 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.
    6. Eugene L. Lawler, 1963. "The Quadratic Assignment Problem," Management Science, INFORMS, vol. 9(4), pages 586-599, July.
    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. Roucairol, Catherine, 1996. "Parallel processing for difficult combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 92(3), pages 573-590, August.
    2. Alexandre Domingues Gonçalves & Artur Alves Pessoa & Cristiana Bentes & Ricardo Farias & Lúcia Maria de A. Drummond, 2017. "A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique," INFORMS Journal on Computing, INFORMS, vol. 29(4), pages 676-687, November.
    3. 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.

    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. 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.
    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. Mouhamadou A. M. T. Baldé & Serigne Gueye & Babacar M. Ndiaye, 2021. "A greedy evolutionary hybridization algorithm for the optimal network and quadratic assignment problem," Operational Research, Springer, vol. 21(3), pages 1663-1690, September.
    5. Yichuan Ding & Henry Wolkowicz, 2009. "A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem," Mathematics of Operations Research, INFORMS, vol. 34(4), pages 1008-1022, November.
    6. Kazuhiro Tsuchiya & Sunil Bharitkar & Yoshiyasu Takefuji, 1996. "A neural network approach to facility layout problems," European Journal of Operational Research, Elsevier, vol. 89(3), pages 556-563, March.
    7. 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.
    8. 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.
    9. Yu, Junfang & Sarker, Bhaba R., 2003. "Directional decomposition heuristic for a linear machine-cell location problem," European Journal of Operational Research, Elsevier, vol. 149(1), pages 142-184, August.
    10. Hao Hu & Renata Sotirov, 2021. "The linearization problem of a binary quadratic problem and its applications," Annals of Operations Research, Springer, vol. 307(1), pages 229-249, December.
    11. Vittorio Maniezzo, 1999. "Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 358-369, November.
    12. Richárd Molnár-Szipai & Anita Varga, 2019. "Integrating combinatorial algorithms into a linear programming solver," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 27(2), pages 475-482, June.
    13. 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.
    14. Hahn, Peter M. & Kim, Bum-Jin & Stutzle, Thomas & Kanthak, Sebastian & Hightower, William L. & Samra, Harvind & Ding, Zhi & Guignard, Monique, 2008. "The quadratic three-dimensional assignment problem: Exact and approximate solution methods," European Journal of Operational Research, Elsevier, vol. 184(2), pages 416-428, January.
    15. Frank Meijer & Renata Sotirov, 2020. "The quadratic cycle cover problem: special cases and efficient bounds," Journal of Combinatorial Optimization, Springer, vol. 39(4), pages 1096-1128, May.
    16. Adams, Warren P. & Guignard, Monique & Hahn, Peter M. & Hightower, William L., 2007. "A level-2 reformulation-linearization technique bound for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 180(3), pages 983-996, August.
    17. Paul D. Dowling & R. F. Love, 1990. "Floor layouts using a multifacility location model," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(6), pages 945-952, December.
    18. Zvi Drezner, 2003. "A New Genetic Algorithm for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 15(3), pages 320-330, August.
    19. Jean-Paul Arnaout, 2018. "Worm optimization for the multiple level warehouse layout problem," Annals of Operations Research, Springer, vol. 269(1), pages 29-51, October.
    20. Jean-Paul Arnaout & Caline ElKhoury & Gamze Karayaz, 2020. "Solving the multiple level warehouse layout problem using ant colony optimization," Operational Research, Springer, vol. 20(1), pages 473-490, March.

    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:81:y:1995:i:3:p:617-628. 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.