1.
Silalahi B, Hanum F, Setyawan F, Supriyo P. ONE-DIMENSIONAL CUTTING STOCK PROBLEM THAT MINIMIZES THE NUMBER OF DIFFERENT PATTERNS. BAREKENG: J. Math. & App. [Internet]. 1Sep.2022 [cited 22Nov.2024];16(3):805-14. Available from: https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/5442