An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns-Reference-Cited by-同舟云学术

An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns

Published:1993-03 Issue:2 Volume:40 Page:161-173
ISSN:0894-069X
Container-title:Naval Research Logistics
language:en
Short-container-title:Naval Research Logistics

Author:

Carraway Robert L.,Schmidt Robert L.,Weatherford Lawrence R.

Publisher

Wiley

Subject

Management Science and Operations Research,Ocean Engineering,Modelling and Simulation

Reference18 articles.

1. Optimal rules for ordering uncertain prospects

2. Dynamic Programming, Princeton University Press. Princeton, NJ, 1957.

3. A Dynamic Programming Approach to Stochastic Assembly Line Balancing

4. , , and , “Nonlinear Multicriteria Cost Functions in Production Scheduling: Generalized Dynamic Programming,” Computers and Operations Research, to be published.

5. Theory and applications of generalized dynamic programming: An overview

Cited by 42 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cost-Effective Active Learning for Bid Exploration in Online Advertising;Proceedings of the 17th ACM International Conference on Web Search and Data Mining;2024-03-04

2. Evolutionary and Estimation of Distribution Algorithms for Unconstrained, Constrained, and Multiobjective Noisy Combinatorial Optimisation Problems;Evolutionary Computation;2023

3. The Risk-Averse Static Stochastic Knapsack Problem;INFORMS Journal on Computing;2021-07

4. Algorithm for Multi-Robot Chance-Constrained Generalized Assignment Problem with Stochastic Resource Consumption;2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS);2020-10-24

5. A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes;Mathematical Programming Computation;2020-06-26