<?xml version="1.0" encoding="UTF-8"?>
<collection>
<dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:language>eng</dc:language>
  <dc:title>Solving stochastic programs with integer recourse by enumeration : A framework using Gröbner basis reductions</dc:title>
  <dc:creator>Schultz, Rüdiger</dc:creator>
  <dc:contributor>Stougie, Leen</dc:contributor>
  <dc:contributor>van der Vlerk, Maarten H.</dc:contributor>
  <dc:type>Article</dc:type>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
  <dc:date>1998</dc:date>
  <dc:subject>Stochastic programming</dc:subject>
  <dc:subject>Integer recourse</dc:subject>
  <dc:subject>Algorithm</dc:subject>
  <dc:subject>Gröbner basis</dc:subject>
  <dc:relation>Mathematical Programming</dc:relation>
  <dc:identifier>http://ddd.uab.cat/record/173</dc:identifier>
  <dc:identifier>00255610v83n2p229</dc:identifier>
  <dc:description>In this paper we present a framework for solving stochastic programs with complete integer recourse and discretely distributed right-hand side vector, using Gröbner basis methods from computational algebra to solve the numerous second-stage integer programs. Using structural properties of the expected integer recourse function, we prove that under mild conditions an optimal solution is contained in a finite set. Furthermore, we present a basic scheme to enumerate this set and suggest improvements to reduce the number of function evaluations needed..</dc:description>
</dc:dc>

</collection>