Finiteness theorems in stochastic integer programming

Simple item page
dc.creatorAschenbrenner, Matthias
dc.creatorHemmecke, Raymond
dc.date2005-02-03
dc.date.accessioned2026-07-07T05:16:40Z
dc.date.available2026-07-07T05:16:40Z
dc.descriptionWe study Graver test sets for families of linear multi-stage stochastic integer programs with varying number of scenarios. We show that these test sets can be decomposed into finitely many ``building blocks'', independent of the number of scenarios, and we give an effective procedure to compute these building blocks. The paper includes an introduction to Nash-Williams' theory of better-quasi-orderings, which is used to show termination of our algorithm. We also apply this theory to finiteness results for Hilbert functions.
dc.description36 pp
dc.identifierhttps://arxiv.org/abs/math/0502078
dc.identifierhttp://arxiv.org/abs/math/0502078
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74075
dc.subjectOptimization and Control
dc.subjectCombinatorics
dc.subject90C15; 90C10; 06A06; 13P10
dc.titleFiniteness theorems in stochastic integer programming
dc.typetext

Files

Collections

arXiv