A polynomial-time algorithm for optimizing over \(N\)-fold 4-block decomposable integer programs (Q3569820)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial-time algorithm for optimizing over \(N\)-fold 4-block decomposable integer programs |
scientific article |
Statements
A Polynomial-Time Algorithm for Optimizing over N-Fold 4-Block Decomposable Integer Programs (English)
0 references
22 June 2010
0 references
\(N\)-fold integer programs
0 references
Graver basis
0 references
augmentation algorithm
0 references
polynomial-time algorithm
0 references
stochastic multi-commodity flow
0 references
stochastic integer programming
0 references
0.8421976566314697
0 references
0.8278787136077881
0 references
0.8192262649536133
0 references
0.7956273555755615
0 references
0.7935141324996948
0 references
