An approximate dynamic programming approach to solving a dynamic, stochastic multiple knapsack problem
Year of publication: |
2009
|
---|---|
Authors: | Perry, Thomas C. ; Hartman, Joseph C. |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 16.2009, 3, p. 347-359
|
Subject: | Mathematische Optimierung | Mathematical programming | Dynamische Optimierung | Dynamic programming | Theorie | Theory | Stochastischer Prozess | Stochastic process | Ganzzahlige Optimierung | Integer programming |
-
Range, Troels Martin, (2017)
-
Integrated anesthesiologist and room scheduling for surgeries : methodology and application
Rath, Sandeep, (2017)
-
Range, Troels Martin, (2018)
- More ...
-
Optimal tax depreciation with loss carry-forward and backward options
Kulp, Alison, (2011)
-
Planning product design refreshes with service contract and competition considerations
Laksana, Kamonkan, (2010)
-
A demand-shifting feasibility algorithm for Benders decomposition
Wu, Peiling, (2003)
- More ...