Registro de Citas
Cita APA (7a ed.)
Lazarev, A. A., & Pravdivets, N. (2020). Polynomial Algorithm for Constructing Pareto-Optimal Schedules for Problem 1∣<em>r</em><sub>j</sub>∣<em>L</em><sub>max</sub>,<em>C</em><sub>max</sub>. IntechOpen. https://doi.org/10.5772/intechopen.93677
Copiado correctamente al portapapeles
Error al copiar al portapapeles
Cita Chicago Style (17a ed.)
Lazarev, Alexander A., y Nikolay Pravdivets. Polynomial Algorithm for Constructing Pareto-Optimal Schedules for Problem 1∣<em>r</em><sub>j</sub>∣<em>L</em><sub>max</sub>,<em>C</em><sub>max</sub>. IntechOpen, 2020. https://doi.org/10.5772/intechopen.93677.
Copiado correctamente al portapapeles
Error al copiar al portapapeles
Cita MLA (9a ed.)
Lazarev, Alexander A., y Nikolay Pravdivets. Polynomial Algorithm for Constructing Pareto-Optimal Schedules for Problem 1∣<em>r</em><sub>j</sub>∣<em>L</em><sub>max</sub>,<em>C</em><sub>max</sub>. IntechOpen, 2020. https://doi.org/10.5772/intechopen.93677.
Copiado correctamente al portapapeles
Error al copiar al portapapeles
Precaución: Estas citas no son 100% exactas.