Premium
Minimum cost flow with set‐constraints
Author(s) -
Hassin Refael
Publication year - 1982
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230120102
Subject(s) - minimum cost flow problem , flow network , generalization , node (physics) , intersection (aeronautics) , flow (mathematics) , mathematical optimization , set (abstract data type) , multi commodity flow problem , mathematics , maximum flow problem , computer science , mathematical analysis , geometry , structural engineering , engineering , programming language , aerospace engineering
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.