Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1-21 |
| Number of pages | 21 |
| Journal | Networks |
| Volume | 12 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1982 |