The solution of combinatorial problems by the dynamic programming algorithm for solving Boolean problems. The algorithm provides the search for optimal solutions in the presence of resource constraints, logical relationships and goals.
|Maintainer||Mikhail Bich <[email protected]>|
|License||MIT + file LICENSE|
|Package repository||View on GitHub|
Install the latest version of this package by entering the following in R:
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.