A Branch and Price algorithm for the \(k\)-splittable maximum flow problem (Q937408): 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.disopt.2008.01.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2087284990 / rank | |||
Normal rank | |||
Revision as of 03:04, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Branch and Price algorithm for the \(k\)-splittable maximum flow problem |
scientific article |
Statements
A Branch and Price algorithm for the \(k\)-splittable maximum flow problem (English)
0 references
15 August 2008
0 references
max flow
0 references
flow width
0 references
column generation
0 references
Branch and Price
0 references
