Minimum cost flow with set‐constraints

DOI Web Site Web Site 7 Citations

Bibliographic Information

Published
1982-03
Rights Information
  • http://onlinelibrary.wiley.com/termsAndConditions#vor
DOI
  • 10.1002/net.3230120102
Publisher
Wiley

Search this article

Description

<jats:title>Abstract</jats:title><jats:p>The minimum cost network flow problem with set‐constraints is a generalization of the well‐known minimum cost network flow problem, in which bounds on the sum of flows through sets of arcs exist. This paper investigates some variations of this problem, including the polymatroid intersection problem, where for each node two polymatroids are given; one polymatroid constrains flows entering the node, and the other constrains flows leaving it.</jats:p>

Journal

  • Networks

    Networks 12 (1), 1-21, 1982-03

    Wiley

Citations (7)*help

See more

Report a problem

Back to top