An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts (Q2458722): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 07:12, 5 March 2024
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
