𝔖 Bobbio Scriptorium
✦   LIBER   ✦

ON THE POSSIBILITIES OF SOLVING COMBINATORIAL PROBLEMS BY ANALYTIC METHODS

✍ Scribed by P. L. Buzytsky; Gregory A. Freiman

Book ID
118718089
Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
306 KB
Volume
337
Category
Article
ISSN
0890-6564

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

On solving the cracked-beam problem by b
On solving the cracked-beam problem by block method
✍ Dosiyev, A. A. ;Cival Buranay, S. πŸ“‚ Article πŸ“… 2007 πŸ› John Wiley and Sons 🌐 English βš– 398 KB

## Abstract An extremely accurate solution is obtained for the cracked‐beam problem by one‐block version of the block method (BM). The obtained numerical results demonstrate the exponential convergence of the BM with respect to the number of quadrature nodes. A simple and high accurate formula to c