CD Skripsi

Menyelesaikan Masalah Aliran Maksimum Dengan Menggunakan Algoritma Ford-Fulkerson Dan Pemrograman Linear

---

ABSTRACT
This nal project discusses the maximum
ow using the Ford-Fulkerson al-
gorithm and linear programming. Maximum
ow problem solving using the
Ford-Fulkerson algorithm is limited to capacity constraints, while solving using
linear programming can be used for various kinds of constraints. At the end of
the discussion, a maximum
ow problem is given which is solved by using both
methods, and both methods produce the same solution. This nal project is a
review of articles of Sushil dan Mangey [Applications and Applied Mathematics,
13 (2018), 508-515].
Keywords: Constraint capacity, augmenting path, maximal
ow, Ford-Fulker-
son algorithm.
viii

---

Ketersediaan

Informasi Detail

Judul Seri

-

No. Panggil

03 03. 121 (0014)

Penerbit

Pekanbaru : Universitas Riau – FMIPA - Matematika., 2021

Deskripsi Fisik

ix, 79 hlm.; ill.: 29 cm

Bahasa

Indonesia

ISBN/ISSN

-

Klasifikasi

03 03. 121 (0014)

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

MATEMATIKA

Info Detail Spesifik

-

Pernyataan Tanggungjawab

ELFITRA

Versi lain/terkait

Lampiran Berkas

Komentar

---

Anda harus masuk sebelum memberikan komentar