APA-Zitierstil (7. Ausg.)

Yu, B., Mitchell, J. E., & Pang, J. (2019). Solving linear programs with complementarity constraints using branch-and-cut. Mathematical programming computation, 11(2), 267-310. https://doi.org/10.1007/s12532-018-0149-2

Chicago-Zitierstil (17. Ausg.)

Yu, Bin, John E. Mitchell, und Jong-Shi Pang. "Solving Linear Programs with Complementarity Constraints Using Branch-and-cut." Mathematical Programming Computation 11, no. 2 (2019): 267-310. https://doi.org/10.1007/s12532-018-0149-2.

MLA-Zitierstil (9. Ausg.)

Yu, Bin, et al. "Solving Linear Programs with Complementarity Constraints Using Branch-and-cut." Mathematical Programming Computation, vol. 11, no. 2, 2019, pp. 267-310, https://doi.org/10.1007/s12532-018-0149-2.