We study the integer multiple criteria knapsack problem and propose dynamicprogramming-based approaches to finding all the nondominated solutions. Different and more complex models are discussed, including the binary multiple criteria knapsack problem, problems with more than one constraint, and mul
Application of dynamic programming to the general inverse problem
โ Scribed by D. M. Trujillo
- Publisher
- John Wiley and Sons
- Year
- 1978
- Tongue
- English
- Weight
- 382 KB
- Volume
- 12
- Category
- Article
- ISSN
- 0029-5981
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In solving optimal control problems, the conventional dynamic programming method often requires interpolations to determine the optimal control law. As a consequence, interpolation errors often degenerate the accuracy of the conventional dynamic programming method. In view of this problem, this pape
The authors extend the deduction of the equations satisfied by the force fields from inertial to rotating frames, when the curves of a certain family are known to be solutions for the equations of motion. Then Drimbii's equation is obtained as a consequence of this result. The works of Hadamard and
The generalized inverse is proving to be a very useful tool in modern linear matrix theory, in particular as a means of determining the least squares solution of a set of simultaneous equations which is overdetermined. However, application of the generalized inverse in structural identification and