Vincent, T., Seipp, F., Ruzika, S., Przybylski, A., & Gandibleux, X. (2013). Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case. Computers & operations research, 40(1), 498-509. https://doi.org/10.1016/j.cor.2012.08.003
Chicago-Zitierstil (17. Ausg.)Vincent, Thomas, Florian Seipp, Stefan Ruzika, Anthony Przybylski, und Xavier Gandibleux. "Multiple Objective Branch and Bound for Mixed 0-1 Linear Programming: Corrections and Improvements for the Biobjective Case." Computers & Operations Research 40, no. 1 (2013): 498-509. https://doi.org/10.1016/j.cor.2012.08.003.
MLA-Zitierstil (9. Ausg.)Vincent, Thomas, et al. "Multiple Objective Branch and Bound for Mixed 0-1 Linear Programming: Corrections and Improvements for the Biobjective Case." Computers & Operations Research, vol. 40, no. 1, 2013, pp. 498-509, https://doi.org/10.1016/j.cor.2012.08.003.