Implementasi Minimal Cost Pada Network Flow dengan Pendekatan Algoritma Out-Of-Kilter

Abstract

This paper is to introduce a broad class of algorithms for finding a minimum cost flow in a capacitated network. The algorithms are of the primal-dual type. They maintain primat feasibility with respect to capacity constraints, while trying to satisfy the conservation of flow equation at each node by means of a wide variety of procedures based on flow augmentation, cost adjustment, and ascent of a dual function