Open Access
RAIRO-Oper. Res.
Volume 58, Number 2, March-April 2024
Page(s) 1105 - 1114
Published online 12 March 2024
  • J. Abadie, Un nouvel algorithme pour la programmation non-linéarire. RAIRO: Recherche Opérationalle 12 (1978) 233–238. [CrossRef] [EDP Sciences] [Google Scholar]
  • W. Adams and L. Waddell, Linear programming insights into solvable cases of the quadratic assignment problem. Discrete Optim. 14 (2014) 46–60. [CrossRef] [MathSciNet] [Google Scholar]
  • J. Balakrishnan and C.H. Cheng, Dynamic layout algorithms: a state-of-the-art survey. Omega – Int. J. Manage. Sci. 26 (1998) 507–521. [CrossRef] [Google Scholar]
  • M.S. Bazaraa, The quadratic set covering (assignment) problem: applications and computation. Technical Report GK-38337, National Science Foundation (1975). [Google Scholar]
  • M.S. Bazaraa, H.D. Sherali and C.M. Shetty, Non-linear Programming – Theory and Algorithms. Wiley-Interscience (2006). [CrossRef] [Google Scholar]
  • D. Brosch and E. de Klerk, Minimum energy configurations on a toric lattice as a quadratic assignment problem. Discrete Optim. 64 (2022) 100612. [CrossRef] [Google Scholar]
  • R.E. Burkard, S.E. Karisch and F. Rendl, Qaplib – a quadratic assignment problem library. J. Global Optim. 10 (1997) 391–403. [CrossRef] [MathSciNet] [Google Scholar]
  • R. Burkard, M. Dell’Amico and S. Martello, Assignment Problems. Revised reprint. SIAM – Society of Industrial and Applied Mathematics, Seiten (2012) 393. [Google Scholar]
  • C. Cubukcuoglu, P. Nourian, M. Fatih Tasgetiren, I. Sevil Sariyildiz and S. Azadi, Hospital layout design renovation as a quadratic assignment problem with geodesic distances. J. Build. Eng. 44 (2021) 102952. [CrossRef] [Google Scholar]
  • A. Drira, H. Pierreval and S. Hajri-Gabouj, Facility layout problems: a literature analysis. IFAC Proc. Vol. 39 (2006) 389–400. [CrossRef] [Google Scholar]
  • G. Finke, R.E. Burkard and F. Rendl, Quadratic assignment problems, in Surveys in Combinatorial Optimization. Vol. 132 of North-Holland Mathematics Studies, edited by S. Martello, G. Laporte, M. Minoux and C. Ribeiro. North-Holland (1987) 61–82. [CrossRef] [Google Scholar]
  • J. Fu, X. Huang and L. Tong, Urban layout optimization in a city network under an extended quadratic assignment problem framework. Transp. A: Transp. Sci. 18 (2022) 221–247. [Google Scholar]
  • M.R. Garey, D.S. Johnson and R. Sethi, Complexity of flowshop and jobshop scheduling. Math. Oper. Res. 1 (1976) 117–129. [CrossRef] [MathSciNet] [Google Scholar]
  • P. Hahn, B.-J. Kim, M. Guignard, J.M. Smith and Y.-R. Zhu, An algorithm for the generalized quadratic assignment problem. Comput. Optim. App. 40 (2008) 351–372. [CrossRef] [Google Scholar]
  • R. Kothari and D. Ghosh, The single row facility layout problem: state of the art. OPSEARCH 49 (2012) 442–462. [CrossRef] [MathSciNet] [Google Scholar]
  • L.S. Lasdon, A.D. Waren, A. Jain and M. Ratner, Design and testing of a generalized reduced gradient code for nonlinear programming. ACM Trans. Math. Softw. 4 (1978) 34–50. [CrossRef] [Google Scholar]
  • E.L. Lawler, The quadratic assignment problem. Manage. Sci. 9 (1963) 586–599. [CrossRef] [Google Scholar]
  • N. Prasad, G. Rajyalakshmi and A. Reddy, A typical manufacturing plant layout design using CRAFT algorithm. Proc. Eng. 97 (2014) 1808–1814. [CrossRef] [Google Scholar]
  • R.T. Rockafellar, Convex Analysis: Princeton Landmarks in Mathematics and Physics. Princeton University Press (1970). [Google Scholar]
  • M.J. Rosenblatt, The dynamics of plant layout. Manage. Sci. 32 (1986) 76–86. [Google Scholar]
  • F.G. Tari and K. Ahadi, Cellular layout design using Tabu search, a case study. RAIRO: Oper. Res. 53 (2019) 1475–1488. [CrossRef] [EDP Sciences] [MathSciNet] [Google Scholar]
  • X. Wu, J. Lu, S. Wu and X. Zhou, Synchronizing time-dependent transportation services: reformulation and solution algorithm using quadratic assignment problem. Transp. Res. Part B: Methodol. 152 (2021) 140–179. [CrossRef] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.