Publisher
Springer Nature Singapore
Reference22 articles.
1. Abadie, J. (1978). Un nouvel algorithme pour la programmation non-linéarire. R.A.I.R.O Recherche Opérationalle, 12(2), 233–238.
2. Adams, W., & Waddell, L. (2014). Linear programming insights into solvable cases of the quadratic assignment problem. Discrete Optimization, 14, 46–60.
3. Balakrishnan, J., & Cheng, C. H. (1998). Dynamic layout algorithms: A state-of-the-art survey. Omega—The International Journal of Management Science, 26(4), 507–521.
4. Bazaraa, M. S. (1975). The quadratic set covering (assignment) problem: Applications and computation (Technical report GK-38337). National Science Foundation.
5. Bazaraa, M. S., Sherali, H. D., & Shetty, C. M. (2006). Non-linear programming—Theory and algorithms. Wiley-Interscience.