Ş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
Citace podle Chicago (17th ed.)Şeker, Oylum, Tınaz Ekim, a 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.
Citace podle MLA (9th ed.)Ş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.