APA-Zitierstil (7. Ausg.)

Hildenbrandt, A. (2019). A branch-and-cut algorithm for the target visitation problem. EURO journal on computational optimization, 7(3), . https://doi.org/10.1007/s13675-019-00111-x

Chicago-Zitierstil (17. Ausg.)

Hildenbrandt, Achim. "A Branch-and-cut Algorithm for the Target Visitation Problem." EURO Journal on Computational Optimization 7, no. 3 (2019). https://doi.org/10.1007/s13675-019-00111-x.

MLA-Zitierstil (9. Ausg.)

Hildenbrandt, Achim. "A Branch-and-cut Algorithm for the Target Visitation Problem." EURO Journal on Computational Optimization, vol. 7, no. 3, 2019, https://doi.org/10.1007/s13675-019-00111-x.