Advanced Search
MyIDEAS: Login to save this article or follow this journal

A survey for the quadratic assignment problem

Contents:

Author Info

  • Loiola, Eliane Maria
  • de Abreu, Nair Maria Maia
  • Boaventura-Netto, Paulo Oswaldo
  • Hahn, Peter
  • Querido, Tania
Registered author(s):

    Abstract

    No abstract is available for this item.

    Download Info

    If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
    File URL: http://www.sciencedirect.com/science/article/B6VCT-4HWXJ62-1/2/b5115b113130832be43e56b1cacb942e
    Download Restriction: Full text for ScienceDirect subscribers only

    As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.

    Bibliographic Info

    Article provided by Elsevier in its journal European Journal of Operational Research.

    Volume (Year): 176 (2007)
    Issue (Month): 2 (January)
    Pages: 657-690

    as in new window
    Handle: RePEc:eee:ejores:v:176:y:2007:i:2:p:657-690

    Contact details of provider:
    Web page: http://www.elsevier.com/locate/eor

    Related research

    Keywords:

    References

    References listed on IDEAS
    Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
    as in new window
    1. Burkard, Rainer E., 1984. "Quadratic assignment problems," European Journal of Operational Research, Elsevier, vol. 15(3), pages 283-289, March.
    2. Burkard, R. E. & Rendl, F., 1984. "A thermodynamically motivated simulation procedure for combinatorial optimization problems," European Journal of Operational Research, Elsevier, vol. 17(2), pages 169-174, August.
    3. Fischer, I. & Gruber, G. & Rendl, F. & Sotirov, R., 2006. "Computational experience with a bundle approach for semidenfinite cutting plane relaxations of max-cut and equipartition," Open Access publications from Tilburg University urn:nbn:nl:ui:12-192911, Tilburg University.
    4. Li, Wu-Ji & Smith, J. MacGregor, 1995. "An algorithm for Quadratic Assignment Problems," European Journal of Operational Research, Elsevier, vol. 81(1), pages 205-216, February.
    5. 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.
    6. Burkard, Rainer E. & Bonniger, Tilman, 1983. "A heuristic for quadratic Boolean programs with applications to quadratic assignment problems," European Journal of Operational Research, Elsevier, vol. 13(4), pages 374-386, August.
    7. 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.
    8. 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.
    9. Frieze, A. M., 1983. "Complexity of a 3-dimensional assignment problem," European Journal of Operational Research, Elsevier, vol. 13(2), pages 161-164, June.
    10. Balakrishnan, Jaydeep & Cheng, Chun Hung & Conway, Daniel G. & Lau, Chun Ming, 2003. "A hybrid genetic algorithm for the dynamic plant layout problem," International Journal of Production Economics, Elsevier, vol. 86(2), pages 107-120, November.
    11. 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.
    12. Pitsoulis, Leonidas S. & Pardalos, Panos M. & Hearn, Donald W., 2001. "Approximate solutions to the turbine balancing problem," European Journal of Operational Research, Elsevier, vol. 130(1), pages 147-155, April.
    13. Christofides, N. & Mingozzi, A. & Toth, P., 1980. "Contributions to the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 4(4), pages 243-247, April.
    14. Heffley, Dennis R., 1980. "Decomposition of the Koopmans-Beckmann Problem," Regional Science and Urban Economics, Elsevier, vol. 10(4), pages 571-580, November.
    15. 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.
    16. Gong, Dijin & Yamazaki, Genji & Gen, Mitsuo & Xu, Weixuan, 1999. "A genetic algorithm method for one-dimensional machine location problems," International Journal of Production Economics, Elsevier, vol. 60(1), pages 337-342, April.
    17. Sarker, Bhaba R. & Wilhelm, Wilbert E. & Hogg, Gary L. & Han, Min-Hong, 1995. "Backtracking of jobs in one-dimensional machine location problems," European Journal of Operational Research, Elsevier, vol. 85(3), pages 593-609, September.
    18. 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.
    19. Rendl, F. & Sotirov, R., 2007. "Bounds for the quadratic assignment problem using the bundle method," Open Access publications from Tilburg University urn:nbn:nl:ui:12-192934, Tilburg University.
    20. Drezner, Zvi, 2005. "The extended concentric tabu for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 160(2), pages 416-422, January.
    21. Mavridou, T. & Pardalos, P.M. & Pitsoulis, L.S. & Resende, Mauricio G.C., 1998. "A GRASP for the biquadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 105(3), pages 613-621, March.
    22. Burkard, Rainer E. & Cela, Eranda, 1995. "Heuristics for biquadratic assignment problems and their computational comparison," European Journal of Operational Research, Elsevier, vol. 83(2), pages 283-300, June.
    23. Rendl, F., 1985. "Ranking scalar products to improve bounds for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 20(3), pages 363-372, June.
    24. Haghani, Ali & Chen, Min-Ching, 1998. "Optimizing gate assignments at airport terminals," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(6), pages 437-454, August.
    25. Solimanpur, M. & Vrat, P. & Shankar, R., 2004. "Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing," European Journal of Operational Research, Elsevier, vol. 157(3), pages 592-606, September.
    26. Taillard, Eric D. & Gambardella, Luca M. & Gendreau, Michel & Potvin, Jean-Yves, 2001. "Adaptive memory programming: A unified view of metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 1-16, November.
    27. Gouveia, Luis & Vo[ss], Stefan, 1995. "A classification of formulations for the (time-dependent) traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 83(1), pages 69-82, May.
    28. Hasegawa, Mikio & Ikeguchi, Tohru & Aihara, Kazuyuki & Itoh, Kohji, 2002. "A novel chaotic search for quadratic assignment problems," European Journal of Operational Research, Elsevier, vol. 139(3), pages 543-556, June.
    29. Kaku, Bharat K & Thompson, Gerald L., 1986. "An exact algorithm for the general quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 23(3), pages 382-390, March.
    30. Magos, D. & Miliotis, P., 1994. "An algorithm for the planar three-index assignment problem," European Journal of Operational Research, Elsevier, vol. 77(1), pages 141-153, August.
    31. 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.
    32. Balakrishnan, Jaydeep & Jacobs, F. Robert & Venkataramanan, Munirpallam A., 1992. "Solutions for the constrained dynamic facility layout problem," European Journal of Operational Research, Elsevier, vol. 57(2), pages 280-286, March.
    33. Frederick S. Hillier & Michael M. Connors, 1966. "Quadratic Assignment Problem Algorithms and the Location of Indivisible Facilities," Management Science, INFORMS, vol. 13(1), pages 42-57, September.
    34. Ramachandran, Bala & Pekny, J. F., 1998. "Lower bounds for nonlinear assignment problems using many body interactions," European Journal of Operational Research, Elsevier, vol. 105(1), pages 202-215, February.
    35. 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.
    36. 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.
    37. 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.
    38. 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.
    39. Tansel, Barbaros C. & Bilen, Canan, 1998. "Move based heuristics for the unidirectional loop network layout problem," European Journal of Operational Research, Elsevier, vol. 108(1), pages 36-48, July.
    40. Heffley, Dennis R, 1972. "The Quadratic Assignment Problem: A Note," Econometrica, Econometric Society, vol. 40(6), pages 1155-63, November.
    41. Chen, Bintong, 1995. "Special cases of the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 81(2), pages 410-419, March.
    42. Connolly, David T., 1990. "An improved annealing scheme for the QAP," European Journal of Operational Research, Elsevier, vol. 46(1), pages 93-100, May.
    43. 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.
    44. Eugene L. Lawler, 1963. "The Quadratic Assignment Problem," Management Science, INFORMS, vol. 9(4), pages 586-599, July.
    45. G. W. Graves & A. B. Whinston, 1970. "An Algorithm for the Quadratic Assignment Problem," Management Science, INFORMS, vol. 16(7), pages 453-471, March.
    46. 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.
    47. Saifallah Benjaafar, 2002. "Modeling and Analysis of Congestion in the Design of Facility Layouts," Management Science, INFORMS, vol. 48(5), pages 679-704, May.
    48. White, D. J., 1994. "Strengthening Gilmore's bound for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 77(1), pages 126-140, August.
    49. Los, Marc, 1978. "Simultaneous optimization of land use and transportation : A synthesis of the quadratic assignment problem and the optimal network problem," Regional Science and Urban Economics, Elsevier, vol. 8(1), pages 21-42, February.
    50. Crama, Yves & Spieksma, Frits C. R., 1992. "Approximation algorithms for three-dimensional assignment problems with triangle inequalities," European Journal of Operational Research, Elsevier, vol. 60(3), pages 273-279, August.
    51. Chiang, Wen-Chyuan & Chiang, Chi, 1998. "Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 457-488, April.
    52. Spiliopoulos, K. & Sofianopoulou, S., 1998. "An optimal tree search method for the manufacturing systems cell formation problem," European Journal of Operational Research, Elsevier, vol. 105(3), pages 537-551, March.
    53. 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.
    54. Warren P. Adams & Hanif D. Sherali, 1986. "A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems," Management Science, INFORMS, vol. 32(10), pages 1274-1290, October.
    55. Bruijs, P. A., 1984. "On the quality of heuristic solutions to a 19 x 19 quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 17(1), pages 21-30, July.
    56. 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.
    57. 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.
    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 in new window

    Cited by:
    1. Mariagiovanna Baccara & Ayse Imrohoroglu & Alistair J. Wilson & Leeat Yariv, 2012. "A Field Study on Matching with Network Externalities," American Economic Review, American Economic Association, vol. 102(5), pages 1773-1804, August.
    2. Paul, G., 2011. "An efficient implementation of the robust tabu search heuristic for sparse quadratic assignment problems," European Journal of Operational Research, Elsevier, vol. 209(3), pages 215-218, March.
    3. Krokhmal, Pavlo A. & Pardalos, Panos M., 2009. "Random assignment problems," European Journal of Operational Research, Elsevier, vol. 194(1), pages 1-17, April.
    4. Angel Juan & Javier Faulin & Albert Ferrer & Helena Lourenço & Barry Barrios, 2013. "MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer, vol. 21(1), pages 109-132, April.
    5. Helber, Stefan & Böhme, Daniel & Oucherif, Farid & Lagershausen, Svenja & Kasper, Steffen, 2014. "A hierarchical facility layout planning approach for large and complex hospitals," Hannover Economic Papers (HEP) dp-527, Leibniz Universität Hannover, Wirtschaftswissenschaftliche Fakultät.
    6. Papahristodoulou, Christos, 2009. "The optimal layout of football players: A case study for AC Milan," MPRA Paper 20102, University Library of Munich, Germany.
    7. Neng Fan & Panos Pardalos, 2010. "Linear and quadratic programming approaches for the general graph partitioning problem," Journal of Global Optimization, Springer, vol. 48(1), pages 57-71, September.
    8. Bard, Jonathan F. & Jarrah, Ahmad I., 2009. "Large-scale constrained clustering for rationalizing pickup and delivery operations," Transportation Research Part B: Methodological, Elsevier, vol. 43(5), pages 542-561, June.
    9. James, Tabitha & Rego, Cesar & Glover, Fred, 2009. "A cooperative parallel tabu search algorithm for the quadratic assignment problem," European Journal of Operational Research, Elsevier, vol. 195(3), pages 810-826, June.
    10. Ruth Misener & Christodoulos Floudas, 2014. "ANTIGONE: Algorithms for coNTinuous / Integer Global Optimization of Nonlinear Equations," Journal of Global Optimization, Springer, vol. 59(2), pages 503-526, July.
    11. 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.

    Lists

    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

    Statistics

    Access and download statistics

    Corrections

    When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:176:y:2007:i:2:p:657-690. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

    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 references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link 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 profile, as there may be some citations waiting for confirmation.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.