An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts (Q2458722)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts |
scientific article |
Statements
An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts (English)
0 references
2 November 2007
0 references
multicommodity
0 references
budget constraint
0 references
upper boundary points for \((\mathbf d,B)\)
0 references
minimal cuts
0 references
stochastic-flow networks
0 references
0 references
0 references
