✦ LIBER ✦

Solution of a Euclidean Combinatorial Optimization Problem by the Dynamic-Programming Method

✍ Scribed by O.A. Yemets; E.V. Roskladka

Book ID: 110337392
Publisher: Springer US
Year: 2002
Tongue: English
Weight: 46 KB
Volume: 38
Category: Article
ISSN: 1573-8337
DOI: 10.1023/a:1015504501828

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic Programming in the Problem of De

Dynamic Programming in the Problem of Decomposition Optimization

✍ A. G. Chentsov; P. A. Chentsov 📂 Article 📅 2002 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 165 KB

Approximate solution of some combinatory

Approximate solution of some combinatory problems of linear programming by the dichotomy method

✍ A.T. Bartkus 📂 Article 📅 1964 🏛 Elsevier Science ⚖ 424 KB

Convergence of a simulation method for s

Convergence of a simulation method for solution of combinatorial optimization problems

✍ L. F. Gulyanitskii; L. B. Koshlai; I. V. Sergienko 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 339 KB

A graphical realization of the dynamic p

A graphical realization of the dynamic programming method for solving -hard combinatorial problems

✍ Alexander A. Lazarev; Frank Werner 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 656 KB

## a b s t r a c t In this paper, we consider a graphical realization of dynamic programming. The concept is discussed on the partition and knapsack problems. In contrast to dynamic programming, the new algorithm can also treat problems with non-integer data without necessary transformations of the

Optimization of multistage feedback proc

Optimization of multistage feedback processes by the method of dynamic programming

✍ A.R. van Cauwenberghe 📂 Article 📅 1964 🏛 Elsevier Science 🌐 English ⚖ 324 KB

A new algorithm for the solution of the

A new algorithm for the solution of the secondary optimization problem in non-serial dynamic programming

✍ Umberto Bertelè; Francesco Brioschi 📂 Article 📅 1969 🏛 Elsevier Science 🌐 English ⚖ 450 KB