Author:
Jouida Sihem Ben,Krichen Saoussen
Publisher
Springer International Publishing
Reference8 articles.
1. Bazgan, C., Hugot, H., Vanderpooten, D.: Solving efficiently the 0–1 multi-objective knapsack problem. Comput. Oper. Res. 36(1), 260–279 (2009)
2. Babaioff, M., Immorlica, N., Kempe, D.: A knapsack secretary problem with applications. In: APPROX 2007 (2007)
3. Chun, Y.H., Moskowitz, H., Plante, R.D.: Dynamic programming formulation of the group interview problem with a general utility function. Eur. J. Oper. Res. 78(1), 81–92 (1994)
4. Kleywegt, A.J., Papastavrou, J.D.: The dynamic and stochastic knapsack problem. Oper. Res. 46, 17–35 (1998)
5. Dynkin, E.B.: Optimal choice of the stopping moment of a markov process. Dokl. Akad. Nauk. SSSR 150, 238–240 (1963)