Resumen de Algoritmo para determinar un fluxo de custo minimo

Ernesto Martins

• Network flow problems arise whenever items must be shipped through a capacitated network to meet customers demand . In the minimal cost flow problem, the items must be distributed so as to mínimize costs. We present a new variant of the dual-simplex algorithm to this problem which is valid when there are no cycles with negative cost.