Wu, W., & Yang, X. (2025). A branch and bound algorithm for continuous multiobjective optimization problems using general ordering cones. European journal of operational research, 326(1), 28-41. https://doi.org/10.1016/j.ejor.2025.04.045
Chicago-Zitierstil (17. Ausg.)Wu, Weitian, und Xinmin Yang. "A Branch and Bound Algorithm for Continuous Multiobjective Optimization Problems Using General Ordering Cones." European Journal of Operational Research 326, no. 1 (2025): 28-41. https://doi.org/10.1016/j.ejor.2025.04.045.
MLA-Zitierstil (9. Ausg.)Wu, Weitian, und Xinmin Yang. "A Branch and Bound Algorithm for Continuous Multiobjective Optimization Problems Using General Ordering Cones." European Journal of Operational Research, vol. 326, no. 1, 2025, pp. 28-41, https://doi.org/10.1016/j.ejor.2025.04.045.