Abstract
The technology of modular enumeration is based on the minimizing of repetitive calculations - their results are stored in RAM and used as needed. While this technology can be used for different types of problems to be solved, optimal parameters of modular enumeration operating mode are known only in the case of solving discrete optimization problems with Boolean variables. The paper contains proofs of two theorems, permitting modular enumeration optimal operating mode determination in general case. The paper also contains examples of solution by modular enumeration optimal organization related to the two problems i. e. the search for the numerical value of multiple integral and that for a globally optimal solution to an extreme problem with Boolean variables, the last being based on knapsack problem solution.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Applied Mathematics, Computational Science and Systems Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
