Cesur, E., Rasit Cesur, M., & Abraham, A. (2024). Enhanced Branch and Bound Algorithm: Minimizing Subproblem Complexity in Power Dispatch. IEEE access, 12, 93753-93760. https://doi.org/10.1109/ACCESS.2024.3422261
Citace podle Chicago (17th ed.)Cesur, Elif, Muhammet Rasit Cesur, a Ajith Abraham. "Enhanced Branch and Bound Algorithm: Minimizing Subproblem Complexity in Power Dispatch." IEEE Access 12 (2024): 93753-93760. https://doi.org/10.1109/ACCESS.2024.3422261.
Citace podle MLA (9th ed.)Cesur, Elif, et al. "Enhanced Branch and Bound Algorithm: Minimizing Subproblem Complexity in Power Dispatch." IEEE Access, vol. 12, 2024, pp. 93753-93760, https://doi.org/10.1109/ACCESS.2024.3422261.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..