STOCHASTIC INTEGER PROGRAMMING BY DYNAMIC PROGRAMMING

B.J. Lageweg, Lenstra J.k, A.H.G. RinnooyKan, L. Stougie and A.H.G. Rinnooy Kan

Statistica Neerlandica, 1985, vol. 39, issue 2, 97-113

Abstract: Stochastic integer programming is a suitable tool for modeling hierarchical decision situations with combinatorial features. In continuation of our work on the design and analysis of heuristics for such problems, we now try to find optimal solutions. Dynamic programming techniques can be used to exploit the structure of two–stage scheduling, bin packing and multiknapsack problems. Numerical results for small instances of these problems are presented.

Date: 1985
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1111/j.1467-9574.1985.tb01131.x

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:bla:stanee:v:39:y:1985:i:2:p:97-113

Ordering information: This journal article can be ordered from
http://www.blackwell ... bs.asp?ref=0039-0402

Access Statistics for this article

Statistica Neerlandica is currently edited by Miroslav Ristic, Marijtje van Duijn and Nan van Geloven

More articles in Statistica Neerlandica from Netherlands Society for Statistics and Operations Research
Bibliographic data for series maintained by Wiley Content Delivery ().