Eisenschmidt, E., & Haus, U. (2013). A polynomial time approximation algorithm for the two-commodity splittable flow problem. Mathematical methods of operations research (Heidelberg, Germany), 77(3), 381-391. https://doi.org/10.1007/s00186-012-0402-9
Chicago-Zitierstil (17. Ausg.)Eisenschmidt, Elke, und Utz-Uwe Haus. "A Polynomial Time Approximation Algorithm for the Two-commodity Splittable Flow Problem." Mathematical Methods of Operations Research (Heidelberg, Germany) 77, no. 3 (2013): 381-391. https://doi.org/10.1007/s00186-012-0402-9.
MLA-Zitierstil (9. Ausg.)Eisenschmidt, Elke, und Utz-Uwe Haus. "A Polynomial Time Approximation Algorithm for the Two-commodity Splittable Flow Problem." Mathematical Methods of Operations Research (Heidelberg, Germany), vol. 77, no. 3, 2013, pp. 381-391, https://doi.org/10.1007/s00186-012-0402-9.