Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022
A simple deterministic dynamic programming model is used as a general framework for the analysis of stochastic versions of three classical optimization problems: knapsack, traveling salesperson, and assembly line balancing problems. It is shown that this model can provide an alternative to the preference order models proposed for these problems. Counterexample to the optimality of the preference order models are presented. © 1981.
Trang H. Tran, Lam Nguyen, et al.
INFORMS 2022
Kafai Lai, Alan E. Rosenbluth, et al.
SPIE Advanced Lithography 2007
A.R. Gourlay, G. Kaye, et al.
Proceedings of SPIE 1989
John R. Kender, Rick Kjeldsen
IEEE Transactions on Pattern Analysis and Machine Intelligence