<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
<channel>
<title>UF - Mathematics</title>
<link>http://repository.ipb.ac.id/handle/123456789/162420</link>
<description/>
<pubDate>Wed, 09 Sep 2026 11:05:08 GMT</pubDate>
<dc:date>2026-09-09T11:05:08Z</dc:date>
<item>
<title>Sifat Pewarnaan Simpul Graf dan Aplikasinya pada Peta Curah Hujan di Kecamatan Bandung Barat Menggunakan Algoritma Greedy</title>
<link>http://repository.ipb.ac.id/handle/123456789/179824</link>
<description>Sifat Pewarnaan Simpul Graf dan Aplikasinya pada Peta Curah Hujan di Kecamatan Bandung Barat Menggunakan Algoritma Greedy
Khairunisa, Natasya Kamila
Tulisan ini membahas beberapa sifat pada pewarnaan simpul (vertex) graf yang berkaitan dengan penentuan bilangan kromatik dan implementasinya untuk memantau distribusi curah hujan pada beberapa daerah kecamatan Bandung Barat menggunakan algoritma Greedy. Hasil penelitian ini menunjukkan bahwa graf hasil representasi peta kecamatan Bandung Barat memiliki bilangan kromatik sebesar ??(??) = 4 karena grafnya bisa diwarnai dengan 4 warna sehingga ? (??) = 4, dengan derajat maksimum graf adalah ? (??) = 8, Sehingga diperoleh 4 = 8. Hasil tersebut menunjukkan bahwa algoritma Greedy mampu menghasilkan pewarnaan graf yang sesuai.&#13;
&#13;
This paper discusses several properties of graph vertex coloring related to the determination of the chromatic number and its implementation for monitoring rainfall distribution in several subdistricts of West Bandung using the Greedy algorithm. The results of this study show that the graph representing the map of subdistricts in West Bandung has a chromatic number of ??(??) = 4 because the graph can be colored with 4 colors, resulting in ??(??) = 4, with the maximum degree of the graph being ??(??) = 8. Thus, 4 = 8 is obtained. These results indicate that the Greedy algorithm is capable of producing an appropriate graph coloring.
</description>
<pubDate>Thu, 01 Jan 2026 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://repository.ipb.ac.id/handle/123456789/179824</guid>
<dc:date>2026-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Dinamika Penularan Penyakit Malaria: Model SEIRS dengan Pengaruh Musim dan Kampanye Kesadaran</title>
<link>http://repository.ipb.ac.id/handle/123456789/179186</link>
<description>Dinamika Penularan Penyakit Malaria: Model SEIRS dengan Pengaruh Musim dan Kampanye Kesadaran
WALIYUDIN, MUHAMAD ARYA
This study reconstructs an SEIRS mathematical model incorporating seasonality and awareness campaigns to analyze malaria dynamics in Indonesia by determining equilibrium points, mosquito regulatory threshold (R), basic reproduction number (R_0), and local stability. Parameter estimation using Least Squares on WHO incidence of malaria per 1000 population at risk in Indonesia 2000–2024 yielded R_0=1.4629 and R=10.8620, indicating both malaria and its vectors persist. Sensitivity analysis and 4th-5th order Runge-Kutta simulations confirm that increasing adult mosquito mortality (?) and decreasing mosquito-to-human transmission (ß_2) which fluctuates seasonally, effectively reduce R_0. Furthermore, global (?) and local (d) awareness campaigns accelerate human transition to the aware group, drastically suppressing the infective mosquito population. In conclusion, vector control, reducing human-mosquito contact, and optimizing awareness campaigns are the most effective strategies to mitigate malaria in Indonesia.
</description>
<pubDate>Thu, 01 Jan 2026 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://repository.ipb.ac.id/handle/123456789/179186</guid>
<dc:date>2026-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Optimisasi Portofolio Saham LQ45 di Indonesia Pada Periode 2020-2024 Dengan Model Mean-CVaR Berbasis Linear Programming</title>
<link>http://repository.ipb.ac.id/handle/123456789/178986</link>
<description>Optimisasi Portofolio Saham LQ45 di Indonesia Pada Periode 2020-2024 Dengan Model Mean-CVaR Berbasis Linear Programming
Ulhaq, Arya Galuh Dhiyaa
Pembentukan portofolio investasi konvensional sering kali mengasumsikan&#13;
return aset berdistribusi normal, tetapi data empirisnya cenderung bersifat fat tails&#13;
dan skewness non-normal. Model Mean-Conditional Value at Risk (Mean-CVaR)&#13;
digunakan dalam penelitian ini untuk mengatasi non-normalitas data return aset.&#13;
Penelitian ini bertujuan untuk membentuk dan mengevaluasi portofolio optimal&#13;
pada saham-saham indeks LQ45 di Bursa Efek Indonesia periode 2020-2024&#13;
menggunakan pendekatan Linear Programming. Data yang digunakan adalah&#13;
return bulanan dari 45 saham LQ45 yang kemudian disaring menggunakan metode&#13;
correlation filtering untuk mereduksi aset yang memiliki korelasi tinggi antar aset.&#13;
Proses optimisasi model dilakukan memanfaatkan libraries Pyomo dengan solver&#13;
GLPK melalui variasi confidence level ?? serta ambang batas korelasi ?? untuk&#13;
membangun kurva efficient frontier. Portofolio optimal global terbaik diperoleh&#13;
pada skenario hiperparameter ?? bernilai 0.9, ?? bernilai 0.5, dan ???????? bernilai 4.059&#13;
dengan nilai rata-rata return portofolio sebesar 4.059% per bulan yang&#13;
menghasilkan nilai ESR tertinggi sebesar 0.582.; Conventional portfolio construction often assumes that the return follow a&#13;
normal distribution, but empirical data often have fat-tails and non-normal&#13;
skewness. Mean-Conditional Value at Risk (Mean-CVaR) is used in this study to&#13;
handle the non-normality of the return dataset. This study goal is to create and&#13;
evaluate optimal portfolio on stocks in LQ45 index in Bursa Efek Indonesia in&#13;
2020-2024 period using Linear Programming. The data that is being used is&#13;
monthly return from 45 LQ45 stocks, then will be filtered using correlation filtering&#13;
method to filter aset with high correlation. The optimization process will use Pyomo&#13;
Python libraries with GLPK solver with variation of confidence level ?? and&#13;
correlation bound ?? for the efficient frontier curve. The global optimal portfolio is&#13;
obtained with the scenario ?? equals 0.9, t equals 0.5, and ???????? equals 4.059 with a&#13;
portfolio return of 4.059% that produce the highest ESR of 0.582.
</description>
<pubDate>Thu, 01 Jan 2026 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://repository.ipb.ac.id/handle/123456789/178986</guid>
<dc:date>2026-01-01T00:00:00Z</dc:date>
</item>
<item>
<title>Penerapan Metode Goal Programming pada Optimasi Penjadwalan Pegawai Non-operasional Stasiun Depok</title>
<link>http://repository.ipb.ac.id/handle/123456789/178920</link>
<description>Penerapan Metode Goal Programming pada Optimasi Penjadwalan Pegawai Non-operasional Stasiun Depok
Michelin, Foky
Penjadwalan pegawai merupakan salah satu faktor penting dalam mendukung kelancaran operasional stasiun serta menjaga kualitas pelayanan kepada pengguna transportasi publik. Penyusunan jadwal secara manual berpotensi menimbulkan ketidakseimbangan beban kerja. Penelitian ini bertujuan memodelkan penjadwalan pegawai non-operasional di Stasiun Depok menggunakan metode Goal Programming (GP) dengan mempertimbangkan pemerataan jumlah shift, pemerataan jam kerja, dan minimisasi jumlah pegawai serta membandingkan hasilnya dengan penelitian sebelumnya menggunakan metode Integer Linear Programming (ILP). Model dikembangkan untuk empat jenis pekerjaan, yaitu pegawai loket, kebersihan, passenger service, dan keamanan. Hasil penelitian menunjukkan bahwa metode goal programming mampu menghasilkan jadwal yang memenuhi seluruh kendala serta meningkatkan pemerataan distribusi shift dan jam kerja. Meskipun pada unit keamanan terdapat kompromi (trade-off) antara pemerataan beban kerja dan efisiensi jumlah pegawai, model tetap menghasilkan pembagian beban kerja yang lebih adil dibandingkan penelitian sebelumnya.; Employee scheduling is an important factor in supporting station operations and maintaining service quality for public transportation users. Manual scheduling may lead to workload imbalance. This study aims to develop a scheduling model for non-operational employees at Depok Station using the Goal Programming (GP) method by considering shift distribution, workload balancing, and workforce minimization, as well as comparing the results with a previous study that employed Integer Linear Programming (ILP). The proposed model was developed for four job categories, namely ticketing staff, cleaning staff, passenger service staff, and security staff. The results show that the Goal Programming model is able to generate schedules that satisfy all operational constraints while improving the fairness of shift distribution and workload allocation. Although a trade-off between workload balancing and workforce efficiency was found in the security unit, the model still produced a fairer workload distribution than the previous study.
</description>
<pubDate>Thu, 01 Jan 2026 00:00:00 GMT</pubDate>
<guid isPermaLink="false">http://repository.ipb.ac.id/handle/123456789/178920</guid>
<dc:date>2026-01-01T00:00:00Z</dc:date>
</item>
</channel>
</rss>
