Back to Search
Start Over
Algoritmo para determinar un fluxo de custo minimo
- Source :
- Recercat. Dipósit de la Recerca de Catalunya, instname, Dipòsit Digital de Documents de la UAB, Universitat Autònoma de Barcelona, Recercat: Dipósit de la Recerca de Catalunya, Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
- Publication Year :
- 2021
-
Abstract
- 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 minimize 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.
Details
- Database :
- OpenAIRE
- Journal :
- Recercat. Dipósit de la Recerca de Catalunya, instname, Dipòsit Digital de Documents de la UAB, Universitat Autònoma de Barcelona, Recercat: Dipósit de la Recerca de Catalunya, Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
- Accession number :
- edsair.doi.dedup.....bb17603607ac9d219ba4fd4d6e42cd2a