(Near)-optimal algorithms for sparse separable convex integer programs (Q6880127)
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 8140031
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | (Near)-optimal algorithms for sparse separable convex integer programs |
scientific article; zbMATH DE number 8140031 |
Statements
(Near)-optimal algorithms for sparse separable convex integer programs (English)
0 references
22 December 2025
0 references
integer programming
0 references
parameterized complexity
0 references
Graver basis
0 references
treedepth
0 references
\(n\)-fold
0 references
tree-fold
0 references
2-stage stochastic
0 references
multi-stage stochastic
0 references
0 references
0 references
0 references
0 references
0 references
