PERANCANGAN PROGRAM APLIKASI CUTTING STOCK PROBLEM DENGAN METODE SEQUENTIAL DYNAMIC PROGRAMMING

ARISANDI, ADE (2009) PERANCANGAN PROGRAM APLIKASI CUTTING STOCK PROBLEM DENGAN METODE SEQUENTIAL DYNAMIC PROGRAMMING. Undergraduate thesis, BINUS.

[img]
Preview
 ["document_typename_pdf" not defined]
2009-1-00400-MTIF Abstrak.pdf
Download (14kB) | Preview
Official URL: http://library.binus.ac.id/Collections/ethesis_det...

Abstract

PERANCANGAN PROGRAM APLIKASI CUTTING STOCK PROBLEM DENGAN METODE SEQUENTIAL DYNAMIC PROGRAMMING - sequential dynamic programming, cutting-stock problem, integer knapsack

Item Type: Thesis (Undergraduate)
Additional Information: 2009-1-00400-MTIF
Subjects: COMPUTER PROGRAMMING
Divisions: Faculty of Computer Studies and Science and Technology > School of Computer Science and Mathematics
Depositing User: Mr. Super Admin
Date Deposited: 11 Jan 2012 20:08
Last Modified: 11 Jan 2012 20:08
URI: http://eprints2.binus.ac.id/id/eprint/3391

Actions (login required)

View Item View Item
Binus e-Thesis is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.