Penyelesaian masalah integer knapsack dengan konstrain minmax menggunakan dynamic programming
Saved in:
Main Authors: | , RAHAJOE, Rr. Ani Dijah, , Drs. Edi Winarko, M.Sc., Ph.D |
---|---|
Format: | Theses and Dissertations NonPeerReviewed |
Published: |
[Yogyakarta] : Universitas Gadjah Mada
2010
|
Subjects: | |
Online Access: | https://repository.ugm.ac.id/86312/ http://etd.ugm.ac.id/index.php?mod=penelitian_detail&sub=PenelitianDetail&act=view&typ=html&buku_id=47176 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universitas Gadjah Mada |
Similar Items
-
Solusi masalah knapsack collapsing dengan pendekatan masalah knapsack baku dan program dinamik
by: , INDARSIH, et al.
Published: (2002) -
MINMAX REGRET MASALAH OPTIMASI KOMBINATORIAL DENGAN DATA INTERVAL
by: , QORIATUN MARYAMAH, et al.
Published: (2014) -
Solusi masalah hard knapsack
by: , NETTI, Syukma, et al.
Published: (2002) -
Penerapan algoritma genetik untuk menyelesaikan masalah Knapsack 0-1
by: , INDRIANINGSIH, Yuliani, et al.
Published: (2002) -
A minmax relationship between embeddable and rigid graphs
by: Tay, T.S., et al.
Published: (2014)