APA (7th ed.) Citation

Şeker, O., Ekim, T., & Taşkın, Z. C. (2021). An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs. European journal of operational research, 291(1), 67-83. https://doi.org/10.1016/j.ejor.2020.09.017

Chicago Style (17th ed.) Citation

Şeker, Oylum, Tınaz Ekim, and Z. Caner Taşkın. "An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs." European Journal of Operational Research 291, no. 1 (2021): 67-83. https://doi.org/10.1016/j.ejor.2020.09.017.

MLA (9th ed.) Citation

Şeker, Oylum, et al. "An Exact Cutting Plane Algorithm to Solve the Selective Graph Coloring Problem in Perfect Graphs." European Journal of Operational Research, vol. 291, no. 1, 2021, pp. 67-83, https://doi.org/10.1016/j.ejor.2020.09.017.