✦ LIBER ✦

The log bucking problem: A comparison of dynamic programming versus branch and bound

✍ Scribed by Paul M. Bobrowski

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 634 KB
Volume: 74
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(94)90226-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Realization of the branch and bound meth

Realization of the branch and bound method for solving the general mixed integer programming problem

✍ M.D. Ivanchev; I.G. Mitev; N.I. Yanev 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 478 KB

Application of the branch and bound meth

Application of the branch and bound method to some discrete programming problems

✍ I.G. Mitev 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 464 KB

A branch and bound algorithm for solving

A branch and bound algorithm for solving a class of nonlinear integer programming problems

✍ A. Victor Cabot; S. Selcuk Erenguc 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 501 KB

A branch and bound algorithm for globall

A branch and bound algorithm for globally solving a class of nonconvex programming problems

✍ Hongwei Jiao 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 574 KB

Computational implementation of a combin

Computational implementation of a combined branch and bound algorithm for the travelling-salesman problem

✍ I.Kh. Sigal 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 588 KB

Dynamic programming and a max-min proble

Dynamic programming and a max-min problem in the theory of structures

✍ Nestor Distefano 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 674 KB

A max-min problem in the realm of optimum beam design is formulated and thoroughly investigated from a dynamic programming point of view. It is shown that the conditions of optimality can be directly derived from the Hamilton-Jacobi-Bellman equation of the process. The classical Euler-Lagrange equat