Sparse integer programming is fixed-parameter tractable

DOI10.1287/MOOR.2023.0162MaRDI QIDQ6923089zbMATH OpenFDO

Authors Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn

Publication date 30 September 2025

Published in Mathematics of Operations Research (Search for Journal in Brave)

zbMATH Keywords

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

Mathematics Subject Classification ID

Integer programming (90C10) Parameterized complexity, tractability and kernelization (68Q27)

This page was built for publication: Sparse integer programming is fixed-parameter tractable

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