(Near)-optimal algorithms for sparse separable convex integer programs

DOI10.1007/978-3-031-93112-3_22MaRDI QIDQ6880127zbMATH OpenFDO

Authors Christoph Hunkenschröder, Martin Koutecký, Asaf Levin, Tung Anh Vu

Publication date 22 December 2025

zbMATH Keywords

integer programmingGraver basisparameterized complexitytreedepth\(n\)-foldtree-fold2-stage stochasticmulti-stage stochastic

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10)

This page was built for publication: (Near)-optimal algorithms for sparse separable convex integer programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6880127)