No label defined (Q4491701)

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 1481726
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 1481726

      Statements

      0 references
      0 references
      26 July 2000
      0 references
      network flow
      0 references
      generalized flow
      0 references
      side constraints
      0 references
      A class of network flows, called multiplicative or \(M\)-flows are subject to multiplicative capacity constraints. These constraints are sums of products with positive coefficients of flow function values on the arcs of subsets of the network arcs. A definition is given to the flow capacity of a cutting set. Maximality conditions for multiplicative flow optimality are obtained. A theorem, analogous to the mincutmaxflow theorem for the classical network flow is proved.
      0 references

      Identifiers