An algorithm to generate all upper boundary points for \((\mathbf d,B) \) in terms of minimal cuts (Q2458722): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.camwa.2006.05.025 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2060631552 / rank | |||
Normal rank | |||
Revision as of 00:12, 20 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
