Graver basis and proximity techniques for block-structured separable convex integer minimization problems (Q2248743)
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: Graver basis and proximity techniques for block-structured separable convex integer minimization problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graver basis and proximity techniques for block-structured separable convex integer minimization problems |
scientific article |
Statements
Graver basis and proximity techniques for block-structured separable convex integer minimization problems (English)
0 references
27 June 2014
0 references
\(N\)-fold integer programs
0 references
Graver basis
0 references
augmentation algorithm
0 references
proximity
0 references
polynomial-time algorithm
0 references
stochastic multi-commodity flow
0 references
stochastic integer programming
0 references
0 references
0 references
0 references
0 references
