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

Quadratic assignment problems

Author

Listed:
  • Burkard, Rainer E.

Abstract

No abstract is available for this item.

Suggested Citation

  • Burkard, Rainer E., 1984. "Quadratic assignment problems," European Journal of Operational Research, Elsevier, vol. 15(3), pages 283-289, March.
    • Handle: RePEc:eee:ejores:v:15:y:1984:i:3:p:283-289
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(84)90093-6
    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. Torki, Abdolhamid & Yajima, Yatsutoshi & Enkawa, Takao, 1996. "A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 384-391, October.
    2. 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.
    3. Broekmeulen, Rob A. C. M. & van Weert, Arjen & Saedt, Anton P. H., 2002. "Comparing three alternative optimisation methods for the treatment planning of bulbs," Agricultural Systems, Elsevier, vol. 72(1), pages 59-71, April.
    4. 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.
    5. 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.
    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. D. J. White, 1993. "A parametric‐based heuristic program for the quadratic assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(4), pages 553-568, June.
    8. Ishwar Murthy, 1993. "Solving the multiperiod assignment problem with start‐up costs using dual ascent," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(3), pages 325-344, April.
    9. Liles, Joseph M. & Robbins, Matthew J. & Lunday, Brian J., 2023. "Improving defensive air battle management by solving a stochastic dynamic assignment problem via approximate dynamic programming," European Journal of Operational Research, Elsevier, vol. 305(3), pages 1435-1449.
    10. 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.
    11. 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.
    12. Huimin Song & Wei Zeng & Jamie M. Chen & Emily Ma, 2024. "COVID-19 Impacts on the Spatial Network of City Tourism in Fujian Province, China," Sustainability, MDPI, vol. 16(8), pages 1-14, April.
    13. Tian, Peng & Ma, Jian & Zhang, Dong-Mo, 1999. "Application of the simulated annealing algorithm to the combinatorial optimisation problem with permutation property: An investigation of generation mechanism," European Journal of Operational Research, Elsevier, vol. 118(1), pages 81-94, October.
    14. Krokhmal, Pavlo A. & Pardalos, Panos M., 2009. "Random assignment problems," European Journal of Operational Research, Elsevier, vol. 194(1), pages 1-17, April.
    15. White, D. J., 1995. "Some concave-convex representations of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 80(2), pages 418-424, January.
    16. J. Puerto, 2020. "An exact completely positive programming formulation for the discrete ordered median problem: an extended version," Journal of Global Optimization, Springer, vol. 77(2), pages 341-359, June.
    17. Maniezzo, Vittorio & Dorigo, Marco & Colorni, Alberto, 1995. "Algodesk: An experimental comparison of eight evolutionary heuristics applied to the Quadratic Assignment Problem," European Journal of Operational Research, Elsevier, vol. 81(1), pages 188-204, February.
    18. Pentico, David W., 2007. "Assignment problems: A golden anniversary survey," European Journal of Operational Research, Elsevier, vol. 176(2), pages 774-793, January.
    19. Arjang Assad & Weixuan Xu, 1992. "The quadratic minimum spanning tree problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(3), pages 399-417, April.

    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:15:y:1984:i:3:p:283-289. 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.