Chandra, C., Liu, Z., He, J., & Ruohonen, T. (2014). A binary branch and bound algorithm to minimize maximum scheduling cost. Omega (Oxford), 42(1), 9-15. https://doi.org/10.1016/j.omega.2013.02.005
Citace podle Chicago (17th ed.)Chandra, Charu, Zhixin Liu, Jun He, a Toni Ruohonen. "A Binary Branch and Bound Algorithm to Minimize Maximum Scheduling Cost." Omega (Oxford) 42, no. 1 (2014): 9-15. https://doi.org/10.1016/j.omega.2013.02.005.
Citace podle MLA (9th ed.)Chandra, Charu, et al. "A Binary Branch and Bound Algorithm to Minimize Maximum Scheduling Cost." Omega (Oxford), vol. 42, no. 1, 2014, pp. 9-15, https://doi.org/10.1016/j.omega.2013.02.005.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..