Buchheim, C., De Santis, M., & Palagi, L. (2015). A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations. Operations research letters, 43(4), 384-388. https://doi.org/10.1016/j.orl.2015.05.001
Citace podle Chicago (17th ed.)Buchheim, Christoph, Marianna De Santis, a Laura Palagi. "A Fast Branch-and-bound Algorithm for Non-convex Quadratic Integer Optimization Subject to Linear Constraints Using Ellipsoidal Relaxations." Operations Research Letters 43, no. 4 (2015): 384-388. https://doi.org/10.1016/j.orl.2015.05.001.
Citace podle MLA (9th ed.)Buchheim, Christoph, et al. "A Fast Branch-and-bound Algorithm for Non-convex Quadratic Integer Optimization Subject to Linear Constraints Using Ellipsoidal Relaxations." Operations Research Letters, vol. 43, no. 4, 2015, pp. 384-388, https://doi.org/10.1016/j.orl.2015.05.001.