Pramudiyanto. , Anang Setyo (2000) Metode clustering dengan pendekatan program linier. Undergraduate thesis, FMIPA UNDIP.
PDF Restricted to Repository staff only 1203Kb | ||
| PDF 18Kb | |
| PDF 222Kb | |
| PDF 300Kb | |
| PDF 237Kb | |
| PDF 335Kb | |
PDF Restricted to Repository staff only 618Kb | ||
| PDF 205Kb | |
| PDF 210Kb |
Abstract
Clustering Method with Linear Programming Approach is used to solve The Clustering Problem. Clustering problem is presented in a network which covers node (representing town) and arch (representing cost should be spent by the investor). By using Labeling Procedure can be view the shortest path which covers node (town) and arch (cost) which is very helpful to the problem solving of city development. Metoda Clustering dengan Pendekatan Program Linier digunakan untuk menyelesaikan permasalahan clustering. Pennasalahan Clustering disajikan dalam bentuk sebuali jaringan yang memuat titik (mewakili kota) dan garis (mewakili biaya yang dikeluarkan investor). Dengan menggunakan Prosedur Labelling didapatkan path terpendek yang memuat titik (kola) dan garis (biaya) yang menyelesaikan permasalahan pengernbangan kawasan kota. ^ ix This document' is Undip Institutional Repository Collection. The author(u) or copyright owner(s) agree that UNDIP-IR may, without changing the content, translate the submission to any medium or format for the purpose of preservation. The author(s) or copyright owner(s) also agree that UNDIP-IR may keep more than one copy of this submission for purpose of.security, back-up and preservation: http://eprints.undip.acid )
Item Type: | Thesis (Undergraduate) |
---|---|
Subjects: | Q Science > QA Mathematics |
Divisions: | Faculty of Science and Mathematics > Department of Mathematics |
ID Code: | 31789 |
Deposited By: | Mr UPT Perpus 1 |
Deposited On: | 25 Nov 2011 08:22 |
Last Modified: | 25 Nov 2011 08:22 |
Repository Staff Only: item control page