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 the normal view instead:
scientific article; zbMATH DE number 5207971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts |
scientific article; zbMATH DE number 5207971 |
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
0.8533623814582825
0 references
0.8413179516792297
0 references
0.8335059881210327
0 references
0.832304060459137
0 references
0.8287922739982605
0 references
