Sulistyo, Wiwin
(2005)
*nalisis Penyelesaian Kasus Knapsack Secara Zero-One dengan Teknik Backtracking.*
JURNAL TEKNOLOGI INFORMASI, 02 (01).
ISSN 1693-8348

## Abstract

The knapsack problem is aparticular type of integer program with one constraint only. It is concerned with the task of selecting objects to be packed into a knapsack. Each object that can go into the knapsack haia size and a benefit (profit). The knapsack has a certain capicity [3]. The typical formulation in practice is the zero-one knapsack problem, where kach object must be put entirely in the knapsack or not included at all, because objects cannot be broken up arbitrarily. The problem is, how to choose the object in the knapsack to get total benefit ?. ~acktrackina~lg orithm; is a strategy for finding satisfied solution. These are -p roblems with a com-p lete solution, in which the order of elements does not matter. Piid a solution by trying one of several choices. If the choice proves tobe incorrect, computation will be backtracked or restarted at the point of previous choice and try another choice. This algorithm attempts to try all the combinations in order to obtain a solution [I], [2], [4]. In this paper, it is used backtracking algorithms to implement of zem-one knapsack problem.

Item Type: | Article |
---|---|

Additional Information: | 6_Volume 02 / Nomor 01 / February 2005_nalisis Penyelesaian Kasus Knapsack Secara Zero-One dengan Teknik Backtracking |

Subjects: | Information Technology |

Divisions: | ?? journal_45_6_Volume-02-Nomor-01-February-2005 ?? |

Depositing User: | Mr. Super Admin |

Date Deposited: | 30 May 2013 17:33 |

Last Modified: | 03 Jun 2013 04:26 |

URI: | http://eprints.binus.ac.id/id/eprint/26699 |

### Actions (login required)

View Item |