A New Method Searching Globally Optimal Solutions to Discrete Optimization Problems

Autor:	Vitaly O. Groppen
Rok vydání:	2021
Předmět:	Dynamic programming Mathematical optimization Discrete optimization problem Discrete programming Computer science Backtracking Knapsack problem Enumeration A priori and a posteriori Boolean data type
Zdroj:	Proceedings of the Future Technologies Conference (FTC) 2021, Volume 3 ISBN: 9783030899110
DOI:	10.1007/978-3-030-89912-7_37
Popis:	A new method searching globally optimal solutions to discrete programming problems is proposed. It is proved that the effectiveness of this method depends only on the number of variables of the problem being solved. The main difference from the methods of implicit enumeration is in the ability to a priori predict, solving by proposed method any extreme problem with Boolean variables, the number of iterations, the running time, and the amount of RAM used.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::479f24835473a492d49928502db44977 https://doi.org/10.1007/978-3-030-89912-7_37 Zobrazit plný text záznamu