An Approximate Dynamic Programming heuristic to support non-strategic project selection for the Royal Canadian Navy. (April 2015)
- Record Type:
- Journal Article
- Title:
- An Approximate Dynamic Programming heuristic to support non-strategic project selection for the Royal Canadian Navy. (April 2015)
- Main Title:
- An Approximate Dynamic Programming heuristic to support non-strategic project selection for the Royal Canadian Navy
- Authors:
- Fisher, Brent
Brimberg, Jack
Hurley, WJ - Abstract:
- We consider an Approximate Dynamic Programming heuristic to support the selection of defense projects when projects have different values and are originated intermittently but fairly frequently. We show that a simple policy reserving a positive fraction of the available budget for high-value projects not yet originated is superior to a greedy knapsack approach.
- Is Part Of:
- Journal of defense modeling and simulation. Volume 12:Number 2(2015:Apr.)
- Journal:
- Journal of defense modeling and simulation
- Issue:
- Volume 12:Number 2(2015:Apr.)
- Issue Display:
- Volume 12, Issue 2 (2015)
- Year:
- 2015
- Volume:
- 12
- Issue:
- 2
- Issue Sort Value:
- 2015-0012-0002-0000
- Page Start:
- 83
- Page End:
- 90
- Publication Date:
- 2015-04
- Subjects:
- Defense project selection -- knapsack problem -- Online Knapsack Problem -- Approximate Dynamic Programming
Military art and science -- Computer simulation -- Periodicals
355.0011305 - Journal URLs:
- http://dms.sagepub.com/ ↗
http://www.uk.sagepub.com ↗ - DOI:
- 10.1177/1548512913509031 ↗
- Languages:
- English
- ISSNs:
- 1548-5129
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 6280.xml