| Autor: |
Sergiy Titov, Lyudmila Chernova, Sergii Chernov |
| Rok vydání: |
2018 |
| Předmět: |
|
| Zdroj: |
2018 IEEE 13th International Scientific and Technical Conference on Computer Sciences and Information Technologies (CSIT). |
| DOI: |
10.1109/stc-csit.2018.8526718 |
| Popis: |
Discrete optimization problems are used for description of models in project management. The need for solution of such problems stimulated the search for effective techniques of calculations. Currently, many combinatorial methods for solution of discrete optimization problems have been developed. Packages of computer application software have been developed for solution of standard discrete optimization problems. Yet the development of simplication algorithms for existing combinatorial techniques is appropriate since in the long run they are formally reduced to the straightforward enumeration of combinations. In case if a non-standard problem arises the method of simplication of its solution is relevant. The method of reduction for certain discrete optimization problems is suggested herein. Consideration of a model example is provided. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
