Loading...
Please wait, while we are loading the content...
Similar Documents
Implementasi Minimal Cost Pada Network Flow Dengan Pendekatan Algoritma Out-Of-Kilter
| Content Provider | Semantic Scholar |
|---|---|
| Author | Suheri, Heppy |
| Copyright Year | 2011 |
| 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. Universitas Sumatera Utara |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://repository.usu.ac.id/bitstream/handle/123456789/24686/Cover.pdf?isAllowed=y&sequence=7 |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |