Surendonk, T. J., & Chircop, P. A. (2020). On the computational complexity of the patrol boat scheduling problem with complete coverage. Naval research logistics, 67(4), 289-299. https://doi.org/10.1002/nav.21900
Citace podle Chicago (17th ed.)Surendonk, Timothy J., a Paul A. Chircop. "On the Computational Complexity of the Patrol Boat Scheduling Problem with Complete Coverage." Naval Research Logistics 67, no. 4 (2020): 289-299. https://doi.org/10.1002/nav.21900.
Citace podle MLA (9th ed.)Surendonk, Timothy J., a Paul A. Chircop. "On the Computational Complexity of the Patrol Boat Scheduling Problem with Complete Coverage." Naval Research Logistics, vol. 67, no. 4, 2020, pp. 289-299, https://doi.org/10.1002/nav.21900.
Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..