APA (7th ed.) Citation

Detienne, B., Sadykov, R., & Tanaka, S. (2016). The two-machine flowshop total completion time problem: Branch-and-bound algorithms based on network-flow formulation. European Journal of Operational Research, 252(3), 750-760. https://doi.org/10.1016/j.ejor.2016.02.003

Chicago Style (17th ed.) Citation

Detienne, Boris, Ruslan Sadykov, and Shunji Tanaka. "The Two-machine Flowshop Total Completion Time Problem: Branch-and-bound Algorithms Based on Network-flow Formulation." European Journal of Operational Research 252, no. 3 (2016): 750-760. https://doi.org/10.1016/j.ejor.2016.02.003.

MLA (9th ed.) Citation

Detienne, Boris, et al. "The Two-machine Flowshop Total Completion Time Problem: Branch-and-bound Algorithms Based on Network-flow Formulation." European Journal of Operational Research, vol. 252, no. 3, 2016, pp. 750-760, https://doi.org/10.1016/j.ejor.2016.02.003.