Finiteness theorems in stochastic integer programming
From MaRDI portal
Publication:2462619
DOI10.1007/s10208-005-0174-1zbMath1183.90313arXivmath/0502078MaRDI QIDQ2462619
Raymond Hemmecke, Matthias Aschenbrenner
Publication date: 3 December 2007
Published in: Foundations of Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0502078
06A06: Partial orders, general
90C10: Integer programming
90C15: Stochastic programming
13P10: Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases)
Related Items
Sequences of commutator operations, A polynomial oracle-time algorithm for convex integer minimization, Constantive Mal’cev clones on finite sets are finitely related