Comparison of Dynamic Programming Algorithm and Greedy Algorithm on Integer Knapsack Problem in Freight Transportation
At this time the delivery of goods to be familiar because the use of delivery of goods services greatly facilitate customers. PT Post Indonesia is one of the delivery of goods. On the delivery of goods, we often encounter the selection of goods which entered first into the transportation and held f...
Main Authors: | Global Ilham Sampurno, Endang Sugiharti, Alamsyah Alamsyah |
---|---|
Format: | Article |
Language: | English |
Published: |
Jurusan Ilmu Komputer Universitas Negeri Semarang
2018-05-01
|
Series: | Scientific Journal of Informatics |
Subjects: | |
Online Access: | https://journal.unnes.ac.id/nju/index.php/sji/article/view/13360 |
Similar Items
-
Improvement of the branch and bound algorithm for solving the knapsack linear integer problem
by: Elias Munapo
Published: (2020-04-01) -
Approximation algorithms for minimum knapsack problem
by: Islam, Mohammad Tauhidul, et al.
Published: (2011) -
Knapsack Problem Solution based on Knapsack Packing Tree Search
by: Mikhail Andreevich Kupriyashin, et al.
Published: (2014-02-01) -
A Comparative Study of Meta-Heuristic Optimization Algorithms for 0 – 1 Knapsack Problem: Some Initial Results
by: Absalom E. Ezugwu, et al.
Published: (2019-01-01) -
Adaptation of a Mosquito Swarm Algorithm to Solve a Binary Knapsack Problem
by: Ruqaya Sha’ban, et al.
Published: (2018-12-01)