Algoritmo para determinar un fluxo de custo minimo

• Martins , Ernesto Q. V. ^[1]
  1. [1] Universidade de Coimbra

     Universidade de Coimbra

     Coimbra (Sé Nova), Portugal

     
• Localización: Publicacions matematiques, ISSN 0214-1493, Nº 22, 1980, págs. 271-274
• Idioma: español
• DOI: 10.5565/publmat_22180_53
• Enlaces
  • Texto completo
• Resumen

  • 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.