Binary knapsack problems with random budgets

Journal of the Operational Research Society

Volumn 54, Issue 9, 2003, Pages 970-983

  Das, S ^a   Ghosh, D ^b  

^a INDIAN INSTITUTE OF MANAGEMENT BANGALORE   (India)

^b INDIAN INSTITUTE OF MANAGEMENT   (India)

Author keywords

Branch and bound; Random budget; Static stochastic knapsack problem

Indexed keywords

BINARY SEQUENCES; CONSTRAINT THEORY; FINANCE; HEURISTIC METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; RANDOM PROCESSES;

RANDOM BUDGETS;

OPERATIONS RESEARCH;

EID: 0042859782     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601596     Document Type: Article

References (12)

1. Martello S and Toth P (1990). Knapsack Problems: Algorithms and Complexity, John Wiley & Sons: Chichester.
2. Steinberg E and Park MS (1979). A preference order dynamic program for a knapsack problem with stochastic rewards. J Op Res Soc 30: 141-147.
3. Sniedovich M (1980). Preference order stochastic knapsack problems: methodological issues. J Op Res Soc 31: 1025-1032.
4. Sniedovich M (1981). Some comments on preference order dynamic programming models. J Math Anal Appl 79: 489-501.
5. Henig MI (1990). Risk criteria in a stochastic knapsack problem. Oper Res 38: 820-835.
6. Carraway RL, Schmidt RL and Weatherford LR (1993). An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns. Nav Res Logist 40: 161-173.
7. Yu G (1996). On the max-min 0-1 knapsack problem with robust optimization applications. Oper Res 44: 407-415.
8. Cohn AM and Barnhart C (1998). The stochastic knapsack problem with random weights: a heuristic approach to robust transportation planning. Presented at the Triennial Symposium on Transportation Analysis (TRISTAN III ), San Juan, Puerto Rico.
9. Ghosh D and Das S (2000). Discrete optimization problems with random cost coefficients. Report # 00A33. SOM Graduate School/Research Institute, University of Groningen.
10. Birge JR and Louveaux F (1997). Introduction to Stochastic Programming. Springer Series in Operations Research, Springer: Berlin.
11. Vlerk MH van der (1995). Stochastic programming with integer recourse, Ph.D. Thesis, University of Groningen.
12. Balas E (1965). An additive algorithm for solving linear programs with zero-one variables. Oper Res 13: 517-546.