F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
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.
F. Odeh, I. Tadjbakhsh
Archive for Rational Mechanics and Analysis
J.P. Locquet, J. Perret, et al.
SPIE Optical Science, Engineering, and Instrumentation 1998
Laxmi Parida, Pier F. Palamara, et al.
BMC Bioinformatics
Imran Nasim, Melanie Weber
SCML 2024