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...
Saved in:
| Main Authors: | Global Ilham Sampurno, Endang Sugiharti, Alamsyah Alamsyah |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
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 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Adaptation of a Mosquito Swarm Algorithm to Solve a Binary Knapsack Problem
by: Ruqaya Sha’ban, et al.
Published: (2018-12-01) -
Solution Methods for the Multiple-Choice Knapsack Problem and Their Applications
by: Tibor Szkaliczki
Published: (2025-03-01) -
On а Recursive-Parallel Algorithm for Solving the Knapsack Problem
by: Vladimir V. Vasilchikov
Published: (2018-04-01) -
Greedy algorithms: a review and open problems
by: Andrea García
Published: (2025-02-01) -
An Implementation of an Initial Scale in Solving Binary Knapsack Problem Using a Genetic Algorithm
by: Abbas Al-Bayati, et al.
Published: (2007-12-01)