Shang, L., Garraffa, M., Della Croce, F., T'Kindt, V., & T'Kindt, L. S. a. M. G. a. F. D. C. a. V. (2018). merging nodes in search trees an exact exponential algorithm for the single machine total tardiness scheduling problem. https://doi.org/10.4230/lipics.ipec.2017.28
Citace podle Chicago (17th ed.)Shang, Lei, Michele Garraffa, Federico Della Croce, Vincent T'Kindt, a Lei Shang and Michele Garraffa and Federico Della Croce and Vincent T'Kindt. Merging Nodes in Search Trees an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem. 2018. https://doi.org/10.4230/lipics.ipec.2017.28.
Citace podle MLA (9th ed.)Shang, Lei, et al. Merging Nodes in Search Trees an Exact Exponential Algorithm for the Single Machine Total Tardiness Scheduling Problem. 2018. https://doi.org/10.4230/lipics.ipec.2017.28.