Cita APA (7a ed.)
Li, A., Guo, T., Han, C., Li, B., & Li, H. (Jun 2024). Optimal pivot path of the simplex method for linear programming based on reinforcement learning. Science China. Mathematics. https://doi.org/10.1007/s11425-022-2259-1
Cita Chicago Style (17a ed.)
Li, Anqi, Tiande Guo, Congying Han, Bonan Li, y Haoran Li. "Optimal Pivot Path of the Simplex Method for Linear Programming Based on Reinforcement Learning." Science China. Mathematics Jun 2024. https://doi.org/10.1007/s11425-022-2259-1.
Cita MLA (9a ed.)
Li, Anqi, et al. "Optimal Pivot Path of the Simplex Method for Linear Programming Based on Reinforcement Learning." Science China. Mathematics, Jun 2024, https://doi.org/10.1007/s11425-022-2259-1.
Precaución: Estas citas no son 100% exactas.