Minimum cost flow with set‐constraints
Copyright policy )Minimum cost flow with set‐constraints
AbstractThe 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.
- Tel Aviv University Israel
minimum cost network flow, algorithm, decomposition, dual problem, Programming involving graphs or networks, submodular function, set-constraints, Deterministic network models in operations research, supermodular functions, polymatroid intersection problem
minimum cost network flow, algorithm, decomposition, dual problem, Programming involving graphs or networks, submodular function, set-constraints, Deterministic network models in operations research, supermodular functions, polymatroid intersection problem
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).41 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!