MENYELESAIKAN PERSOALAN TRANSPORTASI DENGAN KENDALA CAMPURAN

dc.contributor.author	Sari, J. K
dc.contributor.author	Karma, A
dc.contributor.author	Gamal, M. D. H
dc.date.accessioned	2013-03-26T01:56:47Z
dc.date.available	2013-03-26T01:56:47Z
dc.date.issued	2013-03-26
dc.identifier.other	Rangga Dwijunanda Putra
dc.identifier.uri	http://repository.unri.ac.id:80/handle/123456789/2688
dc.description.abstract	A new algorithm of transportation that is more-for-less (MFL) algorithm has been used to solve transportation problems with mixed constraints. The proposed of this transportation problem is to determine how many product that should shipped from each sources to each destination. Hence each demand from each destination can be fulflled with minimum total shipping cost	en_US
dc.description.provenance	Submitted by Rangga Dwijunanda Putra (rangga.madridista@gmail.com) on 2013-03-26T01:56:47Z No. of bitstreams: 1 karya ilmiah juni kartika sari.pdf: 141315 bytes, checksum: b419e68a5614877805b3e1b0df0edfab (MD5)	en
dc.description.provenance	Made available in DSpace on 2013-03-26T01:56:47Z (GMT). No. of bitstreams: 1 karya ilmiah juni kartika sari.pdf: 141315 bytes, checksum: b419e68a5614877805b3e1b0df0edfab (MD5)	en
dc.description.sponsorship	Karma, A., Gamal, M. D. H	en_US
dc.language.iso	other	en_US
dc.subject	transportation problem	en_US
dc.subject	mixed constraint	en_US
dc.subject	more-for-less	en_US
dc.title	MENYELESAIKAN PERSOALAN TRANSPORTASI DENGAN KENDALA CAMPURAN	en_US
dc.type	Other	en_US