A Branch and Price algorithm for the \(k\)-splittable maximum flow problem (Q937408)
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 5312366
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Branch and Price algorithm for the \(k\)-splittable maximum flow problem |
scientific article; zbMATH DE number 5312366 |
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
0.8224843740463257
0 references
0.8091921806335449
0 references
0.806174635887146
0 references
0.7963491082191467
0 references
0.7927219271659851
0 references
