No label defined (Q4550771)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1795722
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1795722

      Statements

      0 references
      0 references
      2002
      0 references
      minimum cost network flow problem
      0 references
      piecewise linear cost function
      0 references
      The authors consider minimum cost network flow problems with piecewise linear arc costs (PLNFP). They present alternative formulations for a number of special cases. The convex PLNFP is formulated as an LP, the fixed charge network flow problem is formulated as an integer program, the concave PLNFP is formulated as fixed charge network flow problem in an extended network. Two cases of neither convex nor concave cost functions are formulated as mixed integer models of fixed charge network flow problems. Some applications of these models are sketched, but no numerical experiments reported. For the entire collection see [Zbl 0988.00046].
      0 references

      Identifiers