GS Documents
Source by Sinta Kemenristek
Total : 115
Solution of Multiple Constraints Knapsack Problem (MCKP) by Using Branch and Bound Method and Greedy Algorithm (CORRESPONDING AUTHOR)
scree. org, 0
I Irmeilyana, PBJ Bangun, I Hazrati
Citation : 0
Year : 0 |
Penerapan Algoritma Dynamic Programming Pada Permasalahan Knapsack 0-1 (similarity)
Turnitin Universitas Sriwijaya, 0
I Irmeilyana, PBJ Bangun, D Pratamawati, WH Septiani
Citation : 0
Year : 0 |
Penyelesaian Algortima Pattern Generation dengan Model Arc-Flow pada Cutting Stock Problem (CSP) Satu Dimensi (similarity)
Turnitin Universitas Sriwijaya, 0
PBJ Bangun, S Octarina, R Apriani
Citation : 0
Year : 0 |
MINIMISASI TRIM LOSS KERTAS GULUNGAN PADA CUTTING STOCK PROBLEM (CSP) SATU DIMENSI
S Octarina, PBJ Bangun, SNK Dewi
Citation : 0
Year : 0 |
Kajian Perencanaan Sistem Zone Tarif dalam Optimasi Transportasi Publik (similarity)
Turnitin Universitas Sriwijaya, 0
PBJ Bangun, S Octarina
Citation : 0
Year : 0 |
Set Covering Modelin Solving Multiple Cuting Stock Problem
P Bangun
Citation : 0
Year : 0 |
Reduksi Pola Pemotongan Kertas Pada Cutting Stock Problem (CSP) Satu Dimensi
P Bangun
Citation : 0
Year : 0 |
SUBSTITUTINGGOMORYCUTTIN GPLANE METHODTOWARDSBALASALGO RITHM FORSOLVINGBINARYLINEAR
P Bangun
Citation : 0
Year : 0 |
Perancangan Model Zona Tarif BRT Trans Musi Zone Tariff Design Model Of BRT Transmusi
P Bangun
Citation : 0
Year : 0 |
algorithm and dotted board model for triangular shape items
L Hanum
Citation : 0
Year : 0 |